#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

#include<atcoder/modint>
using mint = atcoder::modint998244353;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll n,m;
    cin>>n>>m;
    mint ans = 1;
    vector<int> use;
    ll res = m;
    for(ll i = 2;i*i<=m;i++){
        if(res%i!=0) continue;
        int cnt = 0;
        while(res%i==0){
            res /= i;
            cnt++;
        }
        use.push_back(cnt);
    }
    if(res!=1) use.push_back(1);
    for(int i = 0;i<use.size();i++){
        int ni = use[i] + 1;
        mint tmp = mint(ni).pow(n) - mint(ni-1).pow(n);
        ans *= tmp;
    }
    cout<<ans.val()<<endl;

}