#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using mint = atcoder::modint998244353;

vector<pair<int, int>> prime_factorize(int N) {
    vector<pair<int, int>> res;
    for (int i = 2; i * i <= N; ++i) {
        if (N % i != 0) continue;
        int cnt = 0;
        while (N % i == 0) {
            ++cnt;
            N /= i;
        }
        res.push_back({i, cnt});
    }
    if (N != 1) res.push_back({N, 1});
    return res;
}

int main() {
    int N, M;
    cin >> N >> M;

    auto pf = prime_factorize(M);
    mint ans = 1;
    for (const auto& [key, value] : pf) {
        ans *= mint(value + 1).pow(N) - mint(value).pow(N);
    }
    cout << ans.val() << endl;
}