#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int inf = 1e9 * 2;
const long long int mxn = 2e6 + 10;
long long int gcd(long long int a, long long int b) {
  return !b ? a : gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a / gcd(a, b)) * b;
}
long long int pw(long long int x, long long int y) {
  long long int r = 1;
  while (y) {
    if (y & 1) r = 1LL * r * x % mod;
    x = 1LL * x * x % mod;
    y >>= 1;
  }
  return r;
}
long long int n, k, a[mxn];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= k; i++) {
    a[i] = ((long long int)a[i] + pw(i, n) + mod - pw(i - 1, n)) % mod;
    for (int j = 2 * i; j <= k; j += i) {
      a[j] = (a[j] + mod - a[i]) % mod;
    }
  }
  long long int ans = 0, ps = 0;
  for (int i = 1; i <= k; i++) {
    ps += a[i];
    ps %= mod;
    ans += (long long int)(ps ^ i);
    ans %= mod;
  }
  cout << ans << '\n';
  return 0;
}
