#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using vi=vector<int>;
using vl=vector<ll>;
using pii=pair<int,int>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=300010,MOD=998244353;
const char en='\n';
const ll LLINF=1ll<<60;
const int LOG = 20;

inline int add(int A, int B) {
	if(A + B >= MOD) return A + B - MOD;
	return A + B;
}

inline int sub(int A, int B) {
	if(A - B < 0) return A - B + MOD;
	return A - B; 
}

inline int mul(int A, int B) {
	return 1ll * A * B % MOD;
}

inline int pot(int A, int B) {
	int ret = 1;
	for(; B ; B >>= 1) {
		if(B & 1) ret = mul(ret, A);
		A = mul(A, A);
	}
	return ret;
}

int fak[N], inv[N];
vector < int > dj[N];

void precompute() {
	fak[0] = 1;
	for(int i = 1;i < N;i++) {
		fak[i] = mul(i, fak[i - 1]);
	}
	inv[N - 1] = pot(fak[N - 1], MOD - 2);
	for(int i = N - 2;i >= 0;i--)
		inv[i] = mul(i + 1, inv[i + 1]);
	for(int i = 1;i < N;i++) {
		for(int j = 2 * i;j < N;j += i)
			dj[j].pb(i);
	}
}

int choose(int n, int k) {
	if(k > n || k < 0) return 0;
	return mul(fak[n], mul(inv[k], inv[n - k]));
}

int n, m, puteva[N][LOG];

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0); precompute();
	cin >> n >> m;
	int sol = mul(m, choose(n, m));
	for(int i = 1;i <= n;i++) {
		puteva[i][1] = 1;
		for(int j = 2;j < LOG;j++) {
			for(int x : dj[i])
				puteva[i][j] = add(puteva[i][j], puteva[x][j - 1]);
		}
		for(int j = 1;j < LOG;j++) {
			sol = sub(sol, mul(puteva[i][j], choose(n / i - 1, m - j)));
		}
	}
	cout << sol << endl;
}