#include<bits/stdc++.h>
#include<bits/extc++.h>
#define int long long
using namespace std;
using namespace __gnu_pbds;
constexpr int M=1e7+5,lim=1e7,mod=998244353;
cc_hash_table<int,int>pos;
int L,R,B,n,a[M],f[M],g[M],id[M],ans[M];
int num,pri[M],low[M];bool vis[M];
vector<tuple<int,int,int>>trans;
void init(int n){
    for (int i=2;i<=n;i++){
        if (!vis[i]) pri[++num]=i,low[i]=i;
        for (int j=1;j<=num&&i*pri[j]<=n;j++){
            vis[i*pri[j]]=1;low[i*pri[j]]=pri[j];
            if (i%pri[j]==0) break;
        }
    }
}
void insert(int x,int y){
    if (pos.find(a[x]/y)==pos.end()) return;
    trans.emplace_back(y,x,pos[a[x]/y]);
}
int rdc(int x){return x>=mod?x-mod:x;}
signed main(){
    scanf("%lld%lld%lld",&L,&R,&B);
    for (int l=1,r,lim=R+B;l<=R;l=r+1){ r=R/(R/l);
        int lft=max(1ll,(L+r-1)/r-B),rht=min(lim,R/r+B);
        for (int i=rht;i>=lft;i--) a[++n]=i; lim=lft-1;
    }
    reverse(a+1,a+n+1);init(1e7);
    for (int i=1;i<=n;i++){
        pos[a[i]]=i;
        if (a[i]>=L&&a[i]<=R) id[a[i]-L]=i;
    }
    ans[0]=L==1;
    for (int i=1;i<=n;i++){
        int now=a[i];
        for (int j=1;now>lim&&pri[j]*pri[j]<=now;j++)
            if (now%pri[j]==0){
                insert(i,pri[j]);
                while (now%pri[j]==0) now/=pri[j];
            }
        if (now>lim) {insert(i,now);continue;}
        while (now>1){
            int tmp=low[now];insert(i,tmp);
            while (now%tmp==0) now/=tmp;
        }
    }
    sort(trans.begin(),trans.end());
    a[0]=-1;f[1]=1;while (B--){
        for (int i=1;i<=n;i++) g[i]=f[i];
        for (auto [z,x,y]:trans) g[x]=rdc(g[x]+g[y]);
        for (int i=1;i<=n;i++){
            if (a[i-1]+1==a[i]) g[i]=rdc(g[i]+f[i-1]);
            if (a[i+1]-1==a[i]) g[i]=rdc(g[i]+f[i+1]);
        }
        for (int i=1;i<=n;i++) f[i]=rdc(g[i]+mod-f[i]);
        for (int i=0;i<=R-L;i++) ans[i]=rdc(ans[i]+f[id[i]]);
    }
    for (int i=0;i<=R-L;i++) printf("%lld ",ans[i]);
    return 0;
}