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 <bits/stdc++.h>
using namespace std;

int main() {
   int m,n;
   cin >> m >> n;
   long long count=1;
   long long M=m;
   while(true) {
       if (n==0) break;
       if (n%2==1) {
           count*=M;
           count%=1000000007;
       }
       M*=M;
       M%=1000000007;
       n/=2;
   }
   cout << count << endl;
}
