#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#define int long long
#define endl '\n'
#define IL inline
using namespace std;
const int N = 2e7 + 10;
const int INF = 0x3f3f3f3f;

IL int read()
{
    int x = 0,f = 1;
    char c = getchar();
    while(c <'0'|| c >'9'){if(c == '-') f = -1;c = getchar();}
    while(c >= '0' && c <= '9') x = x * 10 + c - '0',c = getchar();
    return x * f;
}

void write(int x)
{
    if(x > 9) write(x / 10);
    putchar(x % 10 + '0');
}

int mod = 998244353;
int ny[N], p[N];
bool vis[N];

int qpow(int a, int b)
{
    int d = a % mod, ans = 1;
    while(b)
    {
        if(b & 1) ans = (ans * d) % mod;
        d = d * d % mod;
        b >>= 1;
    }
    return ans;
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, k, m = 0;
    cin >> n >> k;
    for(int i = 2;i <= n;i++)
    {
        if(!vis[i])
        {
            p[++m] = i;
            ny[i] = qpow(qpow(i, k), mod - 2);
        }
        for(int j = 1;p[j] * i <= n && j <= m;j++)
        {
            vis[i * p[j]] = 1;
            ny[i * p[j]] = ny[i] * ny[p[j]] % mod;
            if(i % p[j] == 0) break;
        }
    }
    int ans = 1, fac = 1;
    for(int i = 2;i <= n;i++)
    {
        fac = (fac * i) % mod;
        ans = (ans + fac * ny[i] % mod) % mod;
    }
    cout << ans << endl;
    return 0;
}