Problem: Let's call an array a of size n coprime iff gcd(a1, a2, ..., an) = 1, where gcd is the greatest common divisor of the arguments.

You are given two numbers n and k. For each i (1 ≤ i ≤ k) you have to determine the number of coprime arrays a of size n such that for every j (1 ≤ j ≤ n) 1 ≤ aj ≤ i. Since the answers can be very large, you have to calculate them modulo 109 + 7.

Input

The first line contains two integers n and k (1 ≤ n, k ≤ 2·106) — the size of the desired arrays and the maximum upper bound on elements, respectively.

Output

Since printing 2·106 numbers may take a lot of time, you have to output the answer in such a way:

Let bi be the number of coprime arrays with elements in range [1, i], taken modulo 109 + 7. You have to print <image>, taken modulo 109 + 7. Here <image> denotes bitwise xor operation (^ in C++ or Java, xor in Pascal).

Examples

Input

3 4


Output

82


Input

2000000 8


Output

339310063

Note

Explanation of the example:

Since the number of coprime arrays is large, we will list the arrays that are non-coprime, but contain only elements in range [1, i]:

For i = 1, the only array is coprime. b1 = 1.

For i = 2, array [2, 2, 2] is not coprime. b2 = 7.

For i = 3, arrays [2, 2, 2] and [3, 3, 3] are not coprime. b3 = 25.

For i = 4, arrays [2, 2, 2], [3, 3, 3], [2, 2, 4], [2, 4, 2], [2, 4, 4], [4, 2, 2], [4, 2, 4], [4, 4, 2] and [4, 4, 4] are not coprime. b4 = 55.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long maxlen = 2000000;
const long long mod = 1e9 + 7;
long long n, k, ans, now;
long long m[2 * maxlen + 5], p[2 * maxlen + 5], cf[2 * maxlen + 5],
    q[2 * maxlen + 5];
long long quick_power(long long x, long long y) {
  long long res = 1;
  for (; y; y = y >> 1, x = (x * x) % mod) {
    if (y & 1) res = (res * x) % mod;
  }
  return res % mod;
}
inline void init1() {
  for (register long long i = 1; i <= maxlen; ++i) m[i] = p[i] = 1;
  for (register long long i = 2; i <= maxlen; ++i) {
    if (p[i] == 0) continue;
    m[i] = -1;
    for (register long long j = 2 * i; j <= maxlen; j += i) {
      p[j] = 0;
      m[j] = m[j] * (-1);
      if ((j / i) % i == 0) m[j] = 0;
    }
  }
}
inline void init2() {
  for (register long long i = 1; i <= k; ++i) q[i] = quick_power(i, n);
  for (register long long i = 1; i <= k; ++i) {
    for (register long long j = i; j <= k; j += i) {
      cf[j] = (cf[j] + q[j / i] * m[i]) % mod,
      cf[j + i] = (cf[j + i] - q[j / i] * m[i]) % mod;
    }
  }
  long long tot = 0;
  for (register long long i = 1; i <= k; ++i) {
    tot = (tot + cf[i]) % mod, cf[i] = tot;
  }
}
signed main() {
  cin >> n >> k;
  init1();
  init2();
  for (register long long i = 1; i <= k; ++i) cf[i] = (cf[i] % mod + mod) % mod;
  for (register long long i = 1; i <= k; ++i) ans = (ans + (cf[i] ^ i)) % mod;
  cout << (ans % mod + mod) % mod << endl;
  return 0;
}