#include<iostream>
using namespace std;
const long long mod=998244353,N=2*1e7+20;
long long n,k,cnt,ans,jc,inv[N],pr[N],pri[N];
long long ksm(long long x,long long y){
    long long z=1;
    while(y){
        if(y&1) z=z*x%mod;
        x=x*x%mod;
        y>>=1;
    }
    return z;
}
int main(){
    int i,j;
    cin>>n>>k;
    inv[1]=1;
    for(i=2;i<=n;i++){
        if(!pri[i]){
            pri[i]=i; 
            pr[++cnt]=i; 
            inv[i]=ksm(ksm(i,mod-2),k); 
        }
        for(j=1;pr[j]*i<=n&&j<=cnt&&pr[j]<=pri[i];j++){
            pri[pr[j]*i]=pr[j]; 
            inv[pr[j]*i]=inv[pr[j]]*inv[i]%mod;
        }
    }
    jc=1; 
    for(i=1;i<=n;i++){
        ans=(ans+jc*inv[i]%mod)%mod;
        jc=jc*(i+1)%mod;
    }
    cout<<ans;
    return 0;
}