#include <bits/stdc++.h>
#include "../lib/math/modpow.hpp"

using namespace std;

#define SZ(x) (int)(x.size())

using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const ld eps = 1e-9;
const ll MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;

template<typename T>
void printv(const vector<T>& s) {
  for(int i=0;i<(int)(s.size());++i) {
    cout << s[i];
    if(i == (int)(s.size())-1) cout << endl;
    else cout << " ";
  }
}

template<typename T1, typename T2>
ostream& operator<<(ostream &os, const pair<T1, T2> p) {
  os << p.first << ":" << p.second;
  return os;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);

  ll n, k; cin >> n >> k;

  vector<ll> ans(k+1);
  for(ll i=1;i<=k;++i) {
    ans[i] = mod_pow<ll>(k/i, n, MOD);
  }
  //printv(ans);

  for(ll i=k-1;i>=1;--i) {
    for(ll j=2*i;j<=k;j+=i) {
      ans[i] = (ans[i] + MOD - ans[j]) % MOD;
    }
  }

  ll su = 0;
  for(ll i=1;i<=k;++i) {
    su += ans[i] * i % MOD;
    su %= MOD;
  }
  cout << su << endl;
  
}
