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;
#define rep(i, n) for (int (i) = 0; (i) < (n); (i)++)

int main() {
	long long M, N; cin >> M >> N;
	long long num = 1;
	while (N > 0) {
		if (N & 1) num = num * M % 1000000007;
		M = M * M % 1000000007;
		N >>= 1;
	}
	cout << num << endl;
}

