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;

const ll MOD = 1000000007;

ll mod_pow(ll n,ll m,ll mod){
  ll res = 1;
  while(m>0){
    if(m&1) res =(res* n) %mod;
    n = n * n % mod;
    m>>=1;
  }
  return res;
}


ll solve(int n,int m){
  return mod_pow(n,m,MOD);
}


int main(){
  ll n,m;
  cin>>n>>m;
  cout<<solve(n,m)<<endl;
}