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>
#include <algorithm>
#include <vector>
#include <string>
#define int long long
using namespace std;
signed main() {
	int m, n, mod = 1000000007;
	cin >> m >> n;
	int k = 1;
	while (n) {
		if (n % 2 == 1) {
			k *= m;
			n--;
		}
		m *= m; n /= 2;
		k %= mod; m %= mod;
	}
	cout << k << endl;
}
