#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#define ALL(v) v.begin(),v.end()
#define For(i,_) for(int i=0,i##end=_;i<i##end;++i) // [0,_)
#define FOR(i,_,__) for(int i=_,i##end=__;i<i##end;++i) // [_,__)
#define Rep(i,_) for(int i=(_)-1;i>=0;--i) // [0,_)
#define REP(i,_,__) for(int i=(__)-1,i##end=_;i>=i##end;--i) // [_,__)
typedef long long ll;
typedef unsigned long long ull;
#define V vector
#define pb push_back
#define pf push_front
#define qb pop_back
#define qf pop_front
#define eb emplace_back
typedef pair<int,int> pii;
typedef pair<ll,int> pli;
#define fi first
#define se second
const int dir[4][2]={{-1,0},{0,1},{1,0},{0,-1}},inf=0x3f3f3f3f,mod=998244353;
const ll infl=0x3f3f3f3f3f3f3f3fll;
template<class T>inline bool ckmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T>inline bool ckmax(T &x,const T &y){return x<y?x=y,1:0;}
int init=[](){return cin.tie(nullptr)->sync_with_stdio(false),0;}();
template<int p>
struct modint{
    int val;
    inline modint(int val_=0):val(val_){}
    inline modint &operator=(int val_){return val=val_,*this;}
    inline modint &operator+=(const modint &k){return val=val+k.val>=p?val+k.val-p:val+k.val,*this;}
    inline modint &operator-=(const modint &k){return val=val-k.val<0?val-k.val+p:val-k.val,*this;}
    inline modint &operator*=(const modint &k){return val=1ll*val*k.val%p,*this;}
    inline modint &operator^=(int k){
        modint ret=1,tmp=*this;
        for(;k;k>>=1,tmp*=tmp)if(k&1)ret*=tmp;
        return val=ret.val,*this;
    }
    inline modint &operator/=(modint k){return *this*=(k^=p-2);}
    inline modint &operator+=(int k){return val=val+k>=p?val+k-p:val+k,*this;}
    inline modint &operator-=(int k){return val=val<k?val-k+p:val-k,*this;}
    inline modint &operator*=(int k){return val=1ll*val*k%p,*this;}
    inline modint &operator/=(int k){return *this*=((modint(k))^=p-2);}
    template<class T>friend modint operator+(modint a,T b){return a+=b;}
    template<class T>friend modint operator-(modint a,T b){return a-=b;}
    template<class T>friend modint operator*(modint a,T b){return a*=b;}
    template<class T>friend modint operator/(modint a,T b){return a/=b;}
    friend modint operator^(modint a,int b){return a^=b;}
    friend bool operator==(modint a,int b){return a.val==b;}
    friend bool operator!=(modint a,int b){return a.val!=b;}
    inline bool operator!(){return !val;}
    inline modint operator-(){return val?p-val:0;}
    inline modint operator++(int){modint tmp=*this;*this+=1;return tmp;}
    inline modint &operator++(){return *this+=1;}
    inline modint operator--(int){modint tmp=*this;*this-=1;return tmp;}
    inline modint &operator--(){return *this-=1;}
};
using mi=modint<mod>;
struct comb_table{
	int n;
	V<mi>fac,ifac;
	inline comb_table(int n_=0){n=n_,init();}
	inline void init(){
		V<mi>(n+1).swap(fac),V<mi>(n+1).swap(ifac);
		fac[0]=1;
		FOR(i,1,n+1)fac[i]=fac[i-1]*i;
		ifac[n]=1/fac[n];
		Rep(i,n)ifac[i]=ifac[i+1]*(i+1);
	}
	inline mi C(int x,int y){return x<y||y<0?0:fac[x]*ifac[y]*ifac[x-y];}
};
int main(){
    int t_case=1;
    //scanf("%d",&t_case);
    while(t_case--){
        int m,n;
        scanf("%d%d",&m,&n);
        comb_table ct(m);
        mi ans=0;
        V<mi>f(m+1);
        f[1]=1;
        for(int i=0;n-i>=2;++i){
            if(all_of(ALL(f),[&](mi x){return !x;}))break;
            V<mi>g(m+1);
            FOR(j,1,m+1)if(f[j].val)for(int k=j<<!!i;k<=m;k+=j){
                g[k]+=f[j];
                if(j==k)assert(j==1);
                else{
                    int x=m/j,y=k/j;
                    ans+=f[j]*(ct.C(x-y,n-i-1)-ct.C(x/y-1,n-i-1))*(n-i);
                }
            }
            f.swap(g);
        }
        printf("%d\n",ans);
    }
    return 0;
}