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<cstdio>
typedef unsigned long long ul;
using namespace std;
ul power(ul n,ul m){
  
  if(m == 0) return 1;
  ul res = 1;
  res = power(n,m/2);
  if(m%2 == 0) return res = res*res%1000000007;
  return res = (((res*res)%1000000007)*n)%1000000007;
}
int main(){
  
  int n,m;
  scanf("%d %d",&n,&m);
  printf("%llu\n",power(n,m));

  return (0);
}