#include<bits/stdc++.h>
using namespace std;

#define LL long long
const int maxn = 2e7+10, mod = 998244353;
int prime[maxn],minp[maxn],pcnt;
int pw[maxn];

LL ksm(LL a,LL k)
{
    LL ans = 1;
    while(k)
    {
        if(k&1) ans = ans * a % mod;
        k >>= 1;
        a = a * a % mod;
    }
    return ans;
}

void init(int n,int k)
{
    for(int i=2;i<=n;i++) minp[i] = i;
    for(int i=2;i<=n;i++)
    {
        if(minp[i]==i) prime[pcnt++] = i;
        for(int j=0,t;j<pcnt && (t=i*prime[j])<=n;j++)
        {
            minp[t] = prime[j];
            if(i%prime[j]==0) break;
        }
    }
    pw[1] = 1%mod;
    for(int i=2;i<=n;i++)
    {
        if(minp[i]==i) pw[i] = ksm(i,k);
        else pw[i] = 1LL*pw[minp[i]]*pw[i/minp[i]]%mod;
    }
}

int main()
{
    int n,k;
    cin>>n>>k;
    init(n,mod-1-k);
    LL ans = 0,jc = 1;
    for(int i=1;i<=n;i++)
    {
        jc = jc*i%mod;
        (ans += jc*pw[i]) %= mod;
    }
    cout<<ans;
    return 0;
}