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 int long long

const int MOD = 1000000007;

int Pow(int m, int n)
{
	if (n == 0) return 1;
	int res = Pow(m*m % MOD, n/2);
	if (n&1) res = res*m % MOD;
	return res;
}

signed main()
{
	int m, n;
	cin >> m >> n;
	printf("%lld\n", Pow(m, n));
	return 0;
}