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

#define int long long
#define MS(x) memset((x), -1, sizeof((x))) 
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define MOD 998244353


template<int64_t mod> struct Combination{
    vector<int64_t> f, rf;
 
    Combination(int max_n): f(max_n+1), rf(max_n+1){
        f[0] = 1;
        for(int i = 1;i <= max_n;i++) f[i] = f[i-1] * i % mod;
		int64_t a = f[max_n], inv = 1;
		for(int64_t b = mod-2;b > 0;b>>=1){
			if(b & 1) inv = inv*a % mod;
			a = a * a % mod;
		}
		for(int i = max_n;i >= 0;i--) inv = (rf[i] = inv) * i % mod;
    }
 
    int64_t operator()(int n, int r){
        return (r < 0 || n < r) ? 0 : f[n] * rf[r] % mod * rf[n-r] % mod;
    }
};

int n, m;
Combination<MOD> ncr(200010);

int memo[50][200010];

int dp(int i, int j){
	if(i > n) return 0;
	if(memo[i][j] != -1) return memo[i][j];
	int ans = ncr((n-i)+(i-1), i-1);
	for(int k = j*2;k <= m;k+=j){
		ans += dp(i+1, k);
		ans %= MOD;
	}
	return memo[i][j] = ans;
}

signed main(){
	cin >> n >> m;

	MS(memo);
	int ans = 0;
	for(int i = 1;i <= m;i++){
		ans += dp(1, i);
		ans %= MOD;
	}
	cout << ans << endl;
	return 0;
}

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <iomanip>
#include <random>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;

ll po(ll a, ll b) {
    ll c = 1;
    while (b) {
        if (b % 2) c = c * a % 998244353;
        a = a * a % 998244353;
        b >>= 1;
    }
    return c;
}

int main() {
    ios::sync_with_stdio(false);
    //110880 144 166320 160
    //H(n,j)=C(n+j-1,j)
    //_1_2_3_4_5
    int n, m;
    ll z = 0, f[1000006] = {1}, g[1000006] = {};
    for (int i = 1; i <= 1000000; i++) f[i] = f[i - 1] * i % 998244353;
    for (int i = 0; i <= 1000000; i++) g[i] = po(f[i], 998244351);
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        vector<int> a;
        int b = i;
        ll c = 1;
        for (int j = 2; j * j <= i; j++) if (b % j == 0) {
            a.push_back(0);
            while (b % j == 0) b /= j, a.back()++;
        }
        if (b > 1) a.push_back(1);
        for (int j : a) {
            c = c * f[n + j - 1] % 998244353 * g[j] % 998244353 * g[n - 1] % 998244353;
        }
        z = (z + c) % 998244353;
    }
    cout << z << '\n';
}
