#include <cstdio>
#include <algorithm>

using namespace std;

const int max1 = 1e5;
const int mod = 998244353;

int m, n;
int fac[max1 + 5], ifac[max1 + 5], ans;

int f[max1 + 5][20];

int C ( int n, int m )
{
    if ( n < 0 || m < 0 || n < m )
        return 0;
    return 1LL * fac[n] * ifac[n - m] % mod * ifac[m] % mod;
}

int main ()
{
    scanf("%d%d", &m, &n);

    fac[0] = 1;
    for ( int i = 1; i <= m; i ++ )
        fac[i] = 1LL * fac[i - 1] * i % mod;
    ifac[0] = ifac[1] = 1;
    for ( int i = 2; i <= m; i ++ )
        ifac[i] = 1LL * (mod - mod / i) * ifac[mod % i] % mod;
    for ( int i = 1; i <= m; i ++ )
        ifac[i] = 1LL * ifac[i - 1] * ifac[i] % mod;
    
    ans = 1LL * C(m, n) * n % mod;

    for ( int i = 1; i <= m; i ++ )
    {
        f[i][1] = 1;
        for ( int j = 1; j < 20; j ++ )
        {
            if ( f[i][j] )
            {
                for ( int k = 2; k * i <= m; k ++ )
                {
                    f[k * i][j + 1] = (f[k * i][j + 1] + f[i][j]) % mod;
                }
            }
        }
    }

    for ( int i = 1; i <= m; i ++ )
    {
        int cnt = m / i;

        for ( int k = 0; k <= min(cnt - 1, n - 1); k ++ )
            if ( n - k < 20 )
                ans = (ans - 1LL * C(cnt - 1, k) * f[i][n - k] + mod) % mod;
    }

    printf("%d\n", ans);

    return 0;
}