#include <iostream>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(n); i++)


using m32 = atcoder::modint998244353;


int main() {
    i64 N,M; cin >> N >> M;
    if(200'000 < N) return 0;
    if(200'000 < M) return 0;

    vector<int> is_prime(M+1, 1); is_prime[0] = is_prime[1] = 0;
    vector<int> largest_prime_factor(M+1, 1);
    vector<int> largest_prime_factor_index(M+1, 0);
    for(i64 i=2; i<=M; i++) if(is_prime[i]) {
        for(i64 j=i*i; j<=M; j+=i) is_prime[j] = 0;
        for(i64 j=i; j<=M; j+=i) largest_prime_factor[j] = i;
    }
    for(i64 i=2; i<=M; i++){
        i64 d = largest_prime_factor[i];
        if(i/d%d == 0) largest_prime_factor_index[i] = largest_prime_factor_index[i/d] + 1;
        else largest_prime_factor_index[i] = 1;
    }
    
    vector<m32> dp(M+1, 1); dp[0] = 0;
    vector<m32> powN(100, 1); rep(i,100) powN[i] = m32(i).pow(N);
    for(int i=2; i<=M; i++){
        int pre = i;
        rep(t, largest_prime_factor_index[i]) pre /= largest_prime_factor[i];
        dp[i] = dp[pre] * powN[1 + largest_prime_factor_index[i]];
    }

    //for(auto a : dp) cout << a.val() << " "; cout << endl;

    for(int i=1; i<=M; i++) if(is_prime[i]) for(int j=M/i; j>=1; j--) dp[j*i] -= dp[j];
    m32 ans = 0;
    for(int i=1; i<=M; i++) ans += dp[i] * (M/i);
    cout << ans.val() << endl;
    return 0;
}


struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;