#include <bits/stdc++.h>
const int N = 2000010;
const int mod = 1000000007;
int pow_mod(int a, int n) {
  if (n == 0) return 1;
  int x = pow_mod(a, n / 2);
  long long ans = (long long)x * x % mod;
  if (n % 2 == 1) ans = ans * a % mod;
  return (int)ans;
}
int n, k, mi[N] = {0};
int tot, Primes[N], Mu[N];
bool isPrime[N];
void Euler_sieve_with_Mu(int n) {
  tot = 0;
  Mu[1] = 1;
  isPrime[1] = false;
  for (int i = 2; i <= n; ++i) isPrime[i] = true;
  for (int i = 2; i <= n; ++i) {
    if (isPrime[i]) {
      Primes[tot++] = i;
      Mu[i] = -1;
    }
    for (int j = 0, d; (d = Primes[j] * i) <= n; ++j) {
      isPrime[d] = false;
      if (i % Primes[j]) {
        Mu[d] = -Mu[i];
      } else {
        Mu[d] = 0;
        break;
      }
    }
  }
}
int sum = 0, d[N] = {0};
int main() {
  scanf("%d%d", &n, &k);
  Euler_sieve_with_Mu(k);
  for (int i = 1; i <= k; ++i) mi[i] = pow_mod(i, n);
  for (int i = 1; i <= k; ++i) {
    d[i] = (d[i] + d[i - 1] + Mu[i]) % mod;
    for (int j = 2 * i; j <= k; j += i) {
      int t = j / i;
      d[j] = (d[j] + Mu[i] * (mi[t] - mi[t - 1])) % mod;
    }
  }
  for (int i = 1; i <= k; ++i) d[i] = (d[i] + mod) % mod;
  for (int i = 1; i <= k; ++i) sum = (sum + (d[i] ^ i)) % mod;
  printf("%d\n", sum);
  return 0;
}
