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 MOD 1000000007

long long ipow(long long b, long long e) {
	if (e == 0) {
		return 1;
	} else if (e % 2 == 0) {
		return ipow(b * b % MOD, e / 2) % MOD;
	} else {
		return ipow(b * b % MOD, e / 2) * b  % MOD;
	}
}

int main() {
	int m, n;
	cin >> m >> n;
	cout << ipow(m, n) % MOD << endl;
	return 0;
}

