#include<bits/stdc++.h>
#define rep2(i,j,k) for(ll i = ll(j); i < ll(k); i++)
#define rep(i,k) rep2(i,0,k)
#define rrep2(i,j,k) for(ll i = ll(j)-1; i >= ll(k); i--)
#define rrep(i,k) rrep2(i,k,0)
#define SZ(a) ll(a.size())
#define eb emplace_back
#define all(a) a.begin(), a.end()

using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;

bool chmax(auto& a, auto b) {return a < b ? a = b, 1 : 0; }
bool chmin(auto& a, auto b) {return a > b ? a = b, 1 : 0; }

const int mod = 998244353;

struct mint {

	ll x;
	mint(ll x = 0): x((x%mod+mod)%mod) {}

	mint &operator+=(const mint &a) { if((x += a.x) >= mod) x -= mod; return *this; }
	mint &operator-=(const mint &a) { if((x += mod-a.x) >= mod) x -= mod; return *this; }
	mint &operator*=(const mint &a) { (x *= a.x) %= mod; return *this; }

	mint operator+(const mint &a) { return mint(*this) += a; }
	mint operator-(const mint &a) { return mint(*this) -= a; }
	mint operator*(const mint &a) { return mint(*this) *= a; }

	mint pow(ll t) {
		mint res(1), a(*this);
		while(t) {
			if(t&1) res *= a;
			a *= a;
			t >>= 1;
		}
		return res;
	}

	mint inv() { return pow(mod-2); }
};

using vm = vector<mint>;
using vvm = vector<vm>;

const int C = 100010;
mint fac[C+1], ifac[C+1];

mint binom(int n, int k) {
	assert(0 <= n and n <= C);
	if(k < 0 or k > n) return 0;
	return fac[n] * ifac[k] * ifac[n-k];
}

mint sub[20][100010];
mint sup[20][100010];

int main(){
	cin.tie(0) -> sync_with_stdio(0);
	fac[0] = 1;
	rep(i, C) fac[i+1] = fac[i] * (i+1);
	ifac[C] = fac[C].inv();
	rrep(i, C) ifac[i] = ifac[i+1] * (i+1);
	int n, m;
	cin >> m >> n;
	vvl div(m+1);
	rep2(i, 1, m+1) div[i].eb(0);
	rep2(i, 1, m+1) for(int j = i; j <= m; j += i) div[j].eb(i);
	sub[0][0] = 1;
	rep2(k, 1, 20) rep2(i, 1, m+1) for(int j : div[i]) if(j < i) sub[k][i] += sub[k-1][j];
	rep(k, 20) {
		if(k >= n) break;
		rrep2(i, m+1, 1) {
			sup[k][i] = binom(m/i, n-k);
			for(int j = 2*i; j <= m; j += i) sup[k][i] -= sup[k][j];
		}
		rep2(i, 1, m+1) {
			sup[k][i] -= binom(m/i-1, n-k-1);
		}
	}
	mint ans;
	rep(k, 20) {
		if(k >= n) break;
		rep2(i, 1, m+1) {
			mint now;
			for(int j : div[i]) now += sub[k][j];
			//cerr << k << ' ' << i << ' ' << now.x << ' ' << sup[k][i].x << endl;
			now *= sup[k][i];
			ans += now * (n-k);
		}
	}
	cout << ans.x << endl;
}