#include<bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 998244353;

ll n,m,ans = 1;
ll power(ll base,ll exp){
  if(exp == 0) return 1;
  ll ret = power(base,exp / 2);
  ret = ret * ret % mod;
  if(exp % 2) ret = (ret * (base % mod)) % mod;
  return ret;
}
int main(){
  cin >> n >> m;
  vector<int> a;
  for(int i = 2; i * i <= m; i++){
    if(m % i == 0){
      int cnt = 0;
      while(m % i == 0){
        m /= i;
        cnt++;
      }
      a.emplace_back(cnt);
    }
  }
  if(m > 1) a.emplace_back(1);
  for(auto &x: a){
    ll p = power(x + 1,n) - power(x,n);
    p = p % mod;
    ans = ans * p % mod;
  }
  cout << ans;
}