For given integers m and n, compute mn (mod 1,000,000,007). Here, A (mod M) is the remainder when A is divided by M.

Constraints

* 1 ≤ m ≤ 100
* 1 ≤ n ≤ 109

Input


m n


Two integers m and n are given in a line.

Output

Print mn (mod 1,000,000,007) in a line.

Examples

Input

2 3


Output

8


Input

5 8


Output

390625
#include <bits/stdc++.h>
using namespace std;
long long N, M;
long long mod_times(long long a, long long b) {
  return ((a % 1000000007) * (b % 1000000007)) % 1000000007;
}
long long pow(long long n, long long p) {
  if (p == 1) {
    return n;
  } else if (!p % 2) {
    long long n2 = pow(n, p / 2);
    return mod_times(n2, n2);
  } else {
    return mod_times(pow(n, p - 1), n);
  }
}
signed main() {
  while (cin >> N >> M) {
    cout << pow(N, M) << endl;
  }
}
