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;
#define int long long
const int mod = 1e9+7;

int modpow(int m, int n){
  if(n == 0) return 1;
  else if(n%2 == 0) return modpow(m*m%mod, n/2);
  else{
    return modpow(m, n - 1)*m%mod;
  }
}

signed main(){
  int m, n; cin >> m >> n;
  cout << modpow(m, n)%mod << endl;
}
