#include <bits/stdc++.h>
/** 幾何ライブラリ **/
#include <complex>
using namespace std;

typedef long long ll;
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()
{
  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 << endl;

  return 0;
}
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T,class U>
inline bool chmax(T &a,U b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}
template<class T,class U>
inline bool chmin(T &a,U b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}
constexpr int INF=1000000000;
constexpr ll llINF=3000000000000000000;
constexpr int mod=998244353;
constexpr double eps=1e-8;
const double pi=acos(-1);
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int Random(int mi,int ma){
    random_device rnd;
    mt19937 mt(rnd());//32bit
    //[mi,ma]
    uniform_int_distribution<int>engine(mi,ma);
    return engine(mt);
}
/*
vector<vector<ll>>C,sC;
void init_comb(int n,int m){
    C.resize(n+1,vector<ll>(m+1,0));
    sC.resize(n+1,vector<ll>(m+1,0));
    C[0][0]=1;
    for(int i=1;i<=n;i++){
        C[i][0]=1;
        for(int j=1;j<=m;j++){
            C[i][j]=(C[i-1][j-1]+C[i-1][j])%mod;
        }
    }
    rep(i,n+1){
        rep(j,m){
            sC[i][j+1]=(sC[i][j]+C[i][j])%mod;
        }
    }
}*/
ll gcd(ll a,ll b){
    while(a%b){
        a%=b;
        swap(a,b);
    }
    return b;
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
bool isprime(int a){
    if(a==1)return false;
    for(int i=2;i*i<=a;i++){
        if(a%i==0)return false;
    }
    return true;
}
vector<int>primes;
void init_prime(int n){
	primes.push_back(2);
    for(int i=3;i<=n;i+=2){
        bool f=true;
        for(int j:primes){
            if(j*j>i)break;
            if(i%j==0){
                f=false;
                break;
            }
        }
        if(f)primes.push_back(i);
    }
}
ll modpow(ll a,ll b){
    ll res=1;
    while(b){
        if(b&1){
            res*=a;
            res%=mod;
        }
        a*=a;
        a%=mod;
        b>>=1;
    }
    return res;
}
vector<ll>inv,fact,factinv;
void init_fact(int n){
    inv.resize(n+1);
    fact.resize(n+1);
    factinv.resize(n+1);
    inv[0]=0;
    inv[1]=1;
    fact[0]=1;
    factinv[0]=1;
    for(ll i=1;i<=n;i++){
        if(i>=2)inv[i]=mod-((mod/i)*inv[mod%i]%mod);
        fact[i]=(fact[i-1]*i)%mod;
        factinv[i]=factinv[i-1]*inv[i]%mod;
    }
}
ll _inv(ll a,ll m=mod){
    //gcd(a,m) must be 1
    ll b=m,u=1,v=0;
    while(b){
        ll t=a/b;
        a-=t*b;swap(a,b);
        u-=t*v;swap(u,v);
    }
    u%=m;
    if(u<0)u+=m;
    return u;
}
ll comb(int a,int b){
    if(a<b)return 0;
    if(a<0)return 0;
    return fact[a]*factinv[a-b]%mod*factinv[b]%mod;
}
ll multicomb(int a,int b){
    return comb(a+b-1,b);
}
int dp[20][200010];
void solve(){
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=m;i++)dp[0][i]=1;
    rep(k,19){
        for(int i=2;i<=m;i++){
            for(int j=1;j*i<=m;j++){
                dp[k+1][i*j]+=dp[k][j];
                if(dp[k+1][i*j]>=mod)dp[k+1][i*j]-=mod;
            }
        }
    }
    int ans=0;
    init_fact(n-1);
    rep(k,20){
        if(k>n-1)continue;
        int sum=0;
        for(int i=1;i<=m;i++){
            sum+=dp[k][i];
            sum%=mod;
        }
            ans+=comb(n-1,k)*sum%mod;
            ans%=mod;
    }
    cout<<ans<<endl;
}
int main(){
    cin.tie(0);ios::sync_with_stdio(false);
    //int t;cin>>t;while(t--)
    solve();
    return 0;
}