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>
#define MOD 1000000007
using namespace std;

long rec(int m, long i){
  if(i == 1)
    return m;
  else{
    long x = rec(m, i/2);
    long y = (x*x) % MOD;
    if(i%2 == 0)
      return y;
    else
      return (y * m) % MOD;
  }
}

int main(){
  int m;
  long n;
  cin >> m >> n;
  cout << rec(m, n) << endl;
}

