#include <bits/stdc++.h>
const int mod = 1e9 + 7;
const int maxn = 2e6 + 5;
int n, k, pi[maxn], num, mu[maxn];
long long val[maxn], ans[maxn];
bool vis[maxn];
inline long long poww(long long x, long long e) {
  long long res = 1;
  while (e > 0) {
    if (e & 1) (res *= x) %= mod;
    e >>= 1;
    (x *= x) %= mod;
  }
  return res;
}
void pre(int lit) {
  mu[1] = 1;
  for (int i = 2; i <= lit; i++) {
    if (!vis[i]) {
      mu[i] = -1;
      pi[++num] = i;
    }
    for (int v = 1; pi[v] * i <= lit && v <= num; v++) {
      vis[i * pi[v]] = true;
      if (i % pi[v] == 0) break;
      mu[i * pi[v]] = -mu[i];
    }
  }
}
int main() {
  std::cin >> n >> k;
  pre(k);
  for (int i = 1; i <= k; i++) val[i] = poww(i, n);
  long long out = 0, tmp = 0;
  for (int i = 1; i <= k; i++) {
    for (int v = 1; v * i <= k; v++)
      (ans[i * v] += mu[i] * (val[v] - val[v - 1]) % mod) %= mod;
    tmp = (tmp + ans[i] + mod) % mod;
    out = (out + (tmp ^ i)) % mod;
  }
  std::cout << out << std::endl;
  return 0;
}
