#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,M;
const ll mo=998244353;

ll comb(ll N_, ll C_) {
	const int NUM_=400001;
	static ll fact[NUM_+1],factr[NUM_+1],inv[NUM_+1];
	if (fact[0]==0) {
		inv[1]=fact[0]=factr[0]=1;
		for (int i=2;i<=NUM_;++i) inv[i] = inv[mo % i] * (mo - mo / i) % mo;
		for (int i=1;i<=NUM_;++i) fact[i]=fact[i-1]*i%mo, factr[i]=factr[i-1]*inv[i]%mo;
	}
	if(C_<0 || C_>N_) return 0;
	return factr[C_]*fact[N_]%mo*factr[N_-C_]%mo;
}

ll pat[202020][100];



void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	
	int cnt=0;
	ll ret=0;
	for(i=1;i<=M;i++) {
		pat[i][1]=1;
		for(j=i*2;j<=M;j+=i) {
			for(x=1;x<=99;x++) {
				if(pat[i][x]==0) break;
				(pat[j][x+1]+=pat[i][x])%=mo;
			}
		}
		for(x=1;x<=99;x++) if(pat[i][x]) {
			(ret+=comb(N-1,x-1)*pat[i][x])%=mo;
		}
		
	}
	cout<<ret<<endl;
	
	
	
	
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}

#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;

const int N = 2e5 + 5, mod = 998244353;

int fact[N], inv[N];

vector<int> primes[N];

int mul(int a, int b){
    return 1ll * a * b % mod;
}

int add(int a, int b){
    return (a + b) % mod;
}

int fp(int b, int p){
    if(!p) return 1;
    ll ret = fp(b, p >> 1);
    ret = ret * ret % mod;
    if(p&1) ret = ret * b % mod;
    return ret;
}

void pre(){
    fact[0] = inv[0] = 1;
    for(int i = 1; i < N; i++){
        fact[i] = mul(fact[i - 1], i);
        inv[i] = fp(fact[i], mod - 2);
    }
}

int ncr(int n, int r){
    if(n < r) return 0;
    int ret = mul(fact[n], inv[n - r]);
    return mul(ret, inv[r]);
}



int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    pre();
    int n, m;
    cin >> n >> m;
    if(n == 1) return cout << m, 0;
    for(int i = 2; i <= m; i++){
        if((int) primes[i].size() > 0) continue;
        for(int j = i; j <= m; j += i){
            int c = 1, tmp = j;
            while(tmp % i == 0){
                tmp /= i;
                c++;
            }
            primes[j].push_back(c);
        }
    }
    int ans = 0;
    for(int i = 1; i <= m; i++){
        int tmp = 1;
        for(auto j: primes[i]){
            int sum = 0;
            for(int k = 1; k <= j; k++){
                sum = add(sum, mul(ncr(n - 2, k - 1), ncr(j, k)));
            }
            tmp = mul(tmp, sum);
        }
        ans = add(ans, tmp);
    }
    cout << ans;

    return 0;
}