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

using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)
#define repn(i,n) for(int i=0;i<(n);++i)
#define sizc(x) ((int)(x).size())
#define allc(x) (x).begin(),(x).end()
#define fir first
#define sec second

template <ui mod>
class modint{
    ui val;
    static constexpr ui rd(ui x){return x<mod?x:x-mod;}
    public:
    modint(ll x=0){val=rd(x%mod+mod);}
    ui get()const{return val;}
    bool operator==(modint o)const{return val==o.val;}
    bool operator!=(modint o)const{return val!=o.val;}
    modint operator-()const{return mod-val;}
    modint &operator+=(modint o){val=rd(val+o.val);return *this;}
    modint &operator-=(modint o){val=rd(val+mod-o.val);return *this;}
    modint &operator*=(modint o){val=(ull)val*o.val%mod;return *this;}
    modint &operator/=(modint o){return *this*=o.inv();}
    modint &operator^=(ull o){modint res=1,x=*this;while(o){if(o&1)res*=x;x*=x;o>>=1;}return *this=res;}
    friend modint operator+(modint a,modint b){return a+=b;}
    friend modint operator-(modint a,modint b){return a-=b;}
    friend modint operator*(modint a,modint b){return a*=b;}
    friend modint operator/(modint a,modint b){return a/=b;}
    friend modint operator^(modint a,ull b){return a^=b;}
    modint &operator++(){return *this+=1;}
    modint &operator--(){return *this-=1;}
    modint operator++(int){modint ret=*this;++*this;return ret;}
    modint operator--(int){modint ret=*this;--*this;return ret;}
    friend istream &operator>>(istream &is,modint &a){return is>>a.val;}
    friend ostream &operator<<(ostream &os,modint a){return os<<a.val;}
    modint inv()const{return *this^mod-2;}
};
using Z=modint<998244353>;

constexpr int N = 1e5+5;

int n,m;

Z fac[N],invf[N];
void init(int n){
    fac[0]=1;rep(i,1,n)fac[i]=fac[i-1]*i;
    invf[n]=1/fac[n];per(i,n,1)invf[i-1]=invf[i]*i;
}
Z C(int n,int m){
    if(m<0||m>n)return 0;
    return fac[n]*invf[m]*invf[n-m];
}
Z f[N],g[N];

signed main(){
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

    cin>>n>>m;
    init(n);
    Z ans=C(n,m)*m;
    rep(i,1,n)f[i]=1;
    rep(i,1,18){
        rep(j,1,n){
            ans-=f[j]*C(n/j-1,m-i);
        }
        rep(j,1,n)g[j]=0;
        rep(j,1,n)rep(k,2,n/j)g[j*k]+=f[j];
        rep(j,1,n)f[j]=g[j];
    }
    cout<<ans<<'\n';
}