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 mypow(long long b, long long e, long long mod) {
  if (e == 0) return 1;
  if (e % 2 == 0)
    return mypow(b * b, e / 2, mod) % mod;
  else
    return b * mypow(b * b, e / 2, mod) % mod;
}
int main() {
  long long m, n;
  cin >> m >> n;
  long long mod = 1000000007;
  long long ans = mypow(m, n, mod);
  cout << ans % mod << endl;
  return 0;
}
