#include <bits/stdc++.h>
using namespace std;
const int N=1e6+40,mod=998244353;
int dps[45][N];
unordered_map<int,int> dp[5];
unordered_map<int,vector<int> >bigfac;
vector<int> fac[N+5];
int l,r,n;
int dfs(int x,int y){
	if(dps[x][y]) return dps[x][y];
	if(!x) return y==1;
	int res=0;
	if(y>1) (res+=dfs(x-1,y-1))%=mod;
	(res+=dfs(x-1,y+1))%=mod;
	for(auto i:fac[y])
		(res+=dfs(x-1,y/i))%=mod;
	return dps[x][y]=res;
}
int dfs1(int x,int y){
	if(dp[x][y]) return dp[x][y];
	if(!x) return y==1;
	int res=0;
	if(y>1) (res+=dfs(x-1,y-1))%=mod;
	(res+=dfs(x-1,y+1))%=mod;
	if(y>N){
		if(bigfac[y].size()){
			for(auto i:bigfac[y])
				(res+=dfs(x-1,y/i))%=mod;
		}
		else for(int i=1;i*i<=y;i++)
			if(y%i==0){
				if(i>1){
					(res+=dfs(x-1,y/i))%=mod;
					bigfac[y].push_back(i);
				}
				if(i*i<y){
					(res+=dfs(x-1,i))%=mod;
					bigfac[y].push_back(y/i);
				}
			}
	}
	else{
		for(auto i:fac[y])
			(res+=dfs(x-1,y/i))%=mod;
	}
	return dp[x][y]=res;
}
int main(){
	cin>>l>>r>>n;
	for(int i=2;i<=min(N,r+n);i++){
		fac[i].push_back(i);
		for(int j=i+i;j<=min(N,r+n);j+=i)
			fac[j].push_back(i);
	}
	for(int i=l;i<=r;i++){
		int ans=0;
		for(int j=0;j<=n;j++){
			if(i<=1e6) (ans+=dfs(j,i))%=mod;
			else (ans+=dfs1(j,i))%=mod;
		}
		cout<<ans<<' ';
	}
	return 0;
}