#include using namespace std; using namespace chrono; #if __has_include() #include using namespace atcoder; #endif int main() { int64_t n, m; cin >> n >> m; using mint = modint998244353; map mp; { int64_t x = m; for (int64_t i = 2; i * i <= x; i++) { while (x % i == 0) { mp[i]++; x /= i; } } if (1 < x) { mp[x]++; } } mint ans = 1; for (auto [a, e] : mp) { ans *= mint(e + 1).pow(n) - mint(e).pow(n); } cout << ans.val() << endl; return 0; }