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;

long long pow(long long m,long long n,long long N)
{
  if(n==0)return 1;
  long long res=pow(m*m%N,n/2,N);
  if(n%2==1) res=(res*m)%N;
  return res;
}

int main()
{
  int m,n;
  cin>>m>>n;
  cout<<pow(m,n,1000000007)<<endl;
  return 0;
}