#include <bits/stdc++.h>
using namespace std;
long long expo(long long a, long long n, long long mod) {
  long long ans = 1;
  while (n) {
    if (n & 1LL) ans = (ans * a) % mod;
    n >>= 1;
    a = (a * a) % mod;
  }
  return ans;
}
const int MOD = 1000000007;
const int N = 2000002;
int prime[N];
void pre() {
  for (int i = (2); i <= (N - 1); ++i) {
    prime[i] = i;
  }
  for (int i = (2); i <= (N - 1); ++i)
    if (prime[i] == i) {
      for (int j = 2 * i; j < N; j += i) {
        prime[j] = min(prime[j], i);
      }
    }
}
vector<int> allFactors(int n) {
  vector<int> res = {1};
  while (n > 1) {
    int p = prime[n];
    int c = 0;
    while (n % p == 0) {
      n /= p;
      c++;
    }
    int pw = 1;
    int siz = res.size();
    for (int i = (1); i <= (c); ++i) {
      pw *= p;
      for (int j = (0); j <= (siz - 1); ++j) {
        res.push_back(res[j] * pw);
      }
    }
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  pre();
  int n, k;
  cin >> n >> k;
  vector<int> ans(k + 1), sum(k + 1);
  ans[1] = 1;
  sum[1] = 0;
  for (int i = (2); i <= (k); ++i) {
    sum[i] = (sum[i - 1] + 1) % MOD;
    vector<int> divs = allFactors(i);
    for (int d : divs)
      if (d > 1 && d < i) {
        sum[i] = (sum[i] + ans[i / d] - ans[(i - 1) / d]) % MOD;
        if (sum[i] < 0) {
          sum[i] += MOD;
        }
      }
    ans[i] = (expo(i, n, MOD) - sum[i]) % MOD;
    if (ans[i] < 0) {
      ans[i] += MOD;
    }
  }
  int total = 0;
  for (int i = (1); i <= (k); ++i) {
    total = (total + (i ^ ans[i])) % MOD;
  }
  cout << total;
  return 0;
}
