#include <bits/stdc++.h>
#define mod 998244353
#define int long long
using namespace std;
int dp[2000005],nxt[2000005],f[2000005],n,ans[2000005];
vector<int> p;
bitset<1000005> isp;
vector<int> NX[2000005];
vector<pair<int,int> > v;
unordered_map<int,signed> mp;
vector<pair<int,int> > F;
vector<int> qwq;
void DFS(int p,int nw)
{
	if(p==F.size())
	{
		if(mp.count(nw)) qwq.push_back(mp[nw]);
		return ;
	}
	for(int i=0;i<=F[p].second;i++) DFS(p+1,nw),nw*=F[p].first;
}
vector<int> ff(int x)
{
	qwq.clear();
	F.clear();
	for(auto t:p)
	{
		if(t*t>x) break;
		int cnt=0;
		while(x%t==0)
		{
			x/=t;
			++cnt;
		}
		F.push_back({t,cnt});
	}
//	cout << x << "?\n";
	if(x>1) F.push_back({x,1});
	DFS(0,1);
	return qwq;
}
signed main()
{
	//p.push_back(1);
	for(int i=2;i<=1000000;i++)
	{
		if(!isp[i])
		{
			p.push_back(i);
			for(int j=i+i;j<=1000000;j+=i) isp[j]=1;
		}
	}
	ios::sync_with_stdio(false);
	cin.tie(0);
	int l,r,B;
	cin >> l >> r >> B;
	vector<pair<int,int> > v;
	for(int i=1;i<=2000000;i++)
	{
		int L=max(1ll,l/i-B),R=r/i+B;
		if(v.empty()||v.back().first>R)
			v.push_back({L,R});
		else v.back().first=min(v.back().first,L);
	}
	v.back().first=1;
	int S=0;
	for(auto t:v) S+=(t.second-t.first+1);
	reverse(v.begin(),v.end());
	for(auto t:v) for(int j=t.first;j<=t.second;j++) f[++n]=j,mp[j]=n;
	dp[1]=1;
	int cnt=0;
//	cout << n << "!!\n";
	for(int i=2;i<=n;i++)
	{
		/*for(int j=i+1;j<=n;j++)
		{
			if(f[j]%f[i]==0) NX[i].push_back(j),++cnt;
		}*/
/*		for(auto j:p)
		{
			if(j*j>f[i]) break;
			if(f[i]%j==0)
			{
				if(mp.count(j)) NX[mp[j]].push_back(i),++cnt;
				if(j!=1&&j*j!=f[i]&&mp.count(f[i]/j)) NX[mp[f[i]/j]].push_back(i),++cnt;
			}
		}*/
		vector<int> qwq=ff(f[i]);
		for(auto t:qwq) if(t!=i) NX[t].push_back(i);
	}
/*	for(int i=1;i<=n;i++)
		for(auto t:NX[i]) cout << i << " " << t << "\n";
	cout << n << "???" << cnt << "\n";*/
	ans[1]=dp[1]=1;
	for(int i=1;i<=B;i++)
	{
		for(int j=1;j<=n;j++)
		{
			if(dp[j])
			{
				for(auto t:NX[j]) 
					nxt[t]+=dp[j];
				if(f[j+1]==f[j]+1) nxt[j+1]+=dp[j];
				if(f[j-1]==f[j]-1) nxt[j-1]+=dp[j];
			}
		}
		for(int k=1;k<=n;k++) ans[k]+=dp[k]=nxt[k]%mod,nxt[k]=0;
/*		for(int i=1;i<=n;i++) cout << dp[i] << " ";
		cout << "\n";*/
	}
	for(int i=1;i<=n;i++)
		if(f[i]<=r&&f[i]>=l) cout << ans[i]%mod << " ";
	return 0;
}