#include<bits/stdc++.h>
#define ls p*2
#define rs p*2+1
#define x first
#define y second
#define endl '\n'
using namespace std;

mt19937 rnd(time(0));
typedef long long LL;
typedef unsigned long long  uLL;
typedef pair<LL,LL>PII;
typedef pair<double,double>PDD;
const double PI=acos(-1);
const int N=2e5+10,M=2e5+10,MOD=998244353,INF=1e9;
int n;
int m;

map<PII,LL>mp;
LL f[N],inv[N],inf[N];
void init(int n)
{
    inv[0] = inf[0] = f[0] = 1;
    inv[1] = inf[1] = f[1] = 1;
    for(int i=2;i<n;i++)
    {
        f[i] = f[i - 1] * i % MOD;
        inv[i] = (MOD - MOD / i) * inv[MOD % i] % MOD;
        inf[i] = inf[i - 1] * inv[i] % MOD;
    }


}
LL C(int a,int b)
{
    return f[a] * inf[b] % MOD * inf[a - b] % MOD;
}
LL calc(LL pos,LL x){
    LL res=0;
    if(pos==1) return 1;
    if(mp.count({pos,x})) return mp[{pos,x}];
    for(int i=1;i<=x/i;i++){
        if(x%i==0){
            if(i!=1){
                res+=calc(pos-1,x/i);
                res=res%MOD;
            }

            if(i*i!=x){
                res+=calc(pos-1,i);
                res=res%MOD;
            }
        }
    }
    mp[{pos,x}]=res;
    return res;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    init(1e5+10);
    cin>>n>>m;
    LL ans=C(n,m)*m%MOD;
    for(int i=1;i<=n;i++){
        int pos=n/i;
        pos--;
        if(pos<0) break;
        for(int j=max(1,m-pos);j<=m;j++){//放在第j位
            LL hou=C(pos,m-j);
            LL qian=calc(j,i);
            if(qian==0) break;
            ans-=hou*qian%MOD;
            ans=(ans%MOD+MOD)%MOD;
        }
    }
    cout<<ans<<endl;
}