#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>

using namespace std;
using ll = long long;

void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void _cout(){ cout << "\n"; } template <class Head, class... Tail> void _cout(Head&& head, Tail&&... tail){ cout << head; _cout(forward<Tail>(tail)...); }
int gcd(int a, int b){ return (b == 0) ? a : gcd(b, a % b); }
template<typename S, typename T> ostream& operator<<(ostream &os, const pair<S, T> &p){ cout << "[" << p.first << ", " << p.second << "]"; return os; }

#define Sq(x) (x)*(x)
#define For(i, n) for(int i = 0; i < (n); i ++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Cusum(T, xs, sxs) vector<T> sxs(xs.size()+1); For(i, (int)xs.size()) sxs[i+1] = sxs[i] + xs[i]
#define Cin(T, ...) T __VA_ARGS__; _cin(__VA_ARGS__)
#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) vector<T> xs(n), ys(n); For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) vector<T> xs(n), ys(n), zs(n); For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinss(T, n, m, xs) Vec2(T, n, m, xs); For(i, n) For(j, m) cin >> xs[i][j]
#define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T, x); map[x] ++; }
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) { for(const auto &e : xs) cout << e << " "; cout << "\n"; }
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
#define Return(expr) { Cout(expr); return 0; }
#define vc vector
#define Mini(a, x) a = min(a, x)
#define Maxi(a, x) a = max(a, x)

constexpr int MOD = 1e9+7;

ll powmod(ll N, ll P){
    if(P == 0) return 1;
    if(P%2 == 0){
        ll t = powmod(N, P/2);
        return t*t % MOD;
    }
    return N * powmod(N, P-1) % MOD;
}

int main(void){
    Cin(int, n, k);
    
    // dp[i] = 1 ~ i までを n 個並べたとき、gcd が 1 になる場合の数
    
    vc<ll> dp(k+1);
    for(int i = 1; i <= k; i ++){
        ll ans = powmod(i, n) % MOD;
        /*
        for(int j = 2; j <= i; j ++){
            ans = (ans - dp[i/j] + MOD) % MOD;
        }
        */
        
        int j;
        for(j = 1; j*j <= i; j ++){
            ans = (ans + MOD - dp[i/j]) % MOD;
        }
        for(j = i/j; j >= 1; j --){
            ll x = i/j - i/(j+1);
            ans = ans + MOD - (x * dp[j] % MOD);
            ans %= MOD;
        }

        dp[i] = ans;
    }
    
    ll ans = 0;
    for(int i = 1; i <= k; i ++){
        ans = (ans + (i * dp[k/i]) % MOD) % MOD;
    }
    Cout(ans);
    
    /*vc<int> a(k+1, 1);

    Rep(n-1){
        vc<int> b(k+1);
        for(int i = 1; i <= k; i ++){
            for(int j = 1; j <= k; j ++){
                b[gcd(i, j)] += a[i];
            }
        }
        a = b;
    }
    
    Couts(a);*/
}


Measured memory_bytes: 4052