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 <algorithm>
#include <iostream>
#include <string>
#include <vector>

const int M=1000000007;

using namespace std;

typedef long long ll;

ll pos(ll m, ll n){
  if(n == 0) return 1;
  ll res=pos((m*m) % M, n/2);
  if(n % 2 == 1){
    res=(res*m) % M;
  }
  return res;
}

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