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 <iostream>
using namespace std;
const long long Mod = 1000000007;
long long Cow(long long n, long long m, long long Mod){
  long long ans = 1;
  while(m > 0){
    if(m & 1){
      ans = ans * n % Mod;
    }
    n = n * n % Mod;
    m >>= 1;
  }
  return ans;
}
int main(){
  long long n, m;
  cin >> n >> m;
  cout << Cow(n,m,Mod) << endl;
  return 0;
}
