#include <bits/stdc++.h>
using namespace std;

using ll = long long;
const int MN = 1e6+5, MOD = 1e9+7;

ll fpow(ll b, int e=MOD-2) {
  ll ret = 1;
  for (; e; e>>=1) {
    if (e&1) ret = ret*b %MOD;
    b = b*b %MOD;
  } return ret;
}

int N, M, pfs[MN]; vector<int> primes;

int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);

  cin >> N >> M;
  ll ans = 0;
  for (int i = 2; i <= M; i++) {
    if (!pfs[i])
      for (int j = i; j <= M; j += i)
        ++pfs[j];
    ans += (pfs[i]&1 ? 1 : -1) * (fpow(M/i*2+1, N) - 1);
  }
  ans = fpow(M*2+1, N) - ans;
  printf("%lld\n", (ans%MOD+MOD)%MOD);

  return 0;
}