#include<iostream>
#include<cstdio>
#include<vector>
#define int long long
using namespace std;
typedef long long ll;
const int p=998244353;
const int MX=100010;

int N, M, ans;
int fac[MX], invf[MX], dep[MX];
vector<int> e[MX];
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
int qpow(int x, int pow)
{
    int ans=1;
    while(pow)
    {
        if(pow&1) ans=ans*x%p;
        x=x*x%p;
        pow>>=1;
    }
    return ans;
}
int inv(int x) {return qpow(x,p-2);}
int C(int n, int m)
{
    if(n==0&&m==0) return 1;
    if(m>n) return ll(0);
    if(m<=n) return fac[n]*invf[m]%p*invf[n-m]%p;
}
void norm()
{
    ans=(ans%p+p)%p;
}
void dfs(int x, int f)
{
    dep[x]=dep[f]+1;
    for(int i=1;i<=dep[x];i++)
    {
        ans-=C((M-x)/x,N-i);
    }
    norm();
    for(auto u:e[x])
    {
        dfs(u,x);
    }
}
signed main()
{
    // freopen("testdata.in","r",stdin);
    fac[0]=1;
    for(int i=1;i<=100000;i++) fac[i]=fac[i-1]*i%p;
    for(int i=0;i<=100000;i++) invf[i]=inv(fac[i]);
    M=read(); N=read();
    ans=C(M,N)*N%p;
    // cout << "ans=" << ans << '\n';
    for(int i=1;i<=M;i++)
    {
        for(int j=2*i;j<=M;j+=i)
        {
            e[i].emplace_back(j);
        }
    }
    dfs(1,0);
    norm();
    cout << ans << '\n';
    return (0-0);
}