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>
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<algorithm>
#define mod 1000000007
#define ll long long
using namespace std;

int main() {
	int a, b;	
		scanf("%d%d", &a, &b);
		ll c = a, d = 1;
		while (b != 1) {
			if (b & 1)d = c*d%mod;
			c = c*c%mod;
			b /= 2;
		}
		printf("%lld\n", c*d%mod);	
}