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;
typedef long long ll;
#define MOD 1000000007
ll calc(ll a,ll b){
  ll res=1;
  for(int i=0;(1<<i)<=b;i++){
    if(b>>i&1) res=(res*a)%MOD;
    a=(a*a)%MOD;
  }
  return res % MOD;
}
int main(){
  ll m,n;
  cin >> m >> n;
  cout << calc(m,n) << endl;
  return 0;
}