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
// AOJ NTL_1_B
#include<cstdio>

typedef long long ll;
const ll mod = 1000000007;

ll powMod( ll m, ll n, ll mod )
{
	ll ret = 1;

	while( n > 0 )
	{
		if( n&1 )
			ret = (ret*m)%mod;

		m = m*m%mod;
		n >>= 1;
	}

	return ret;
}

int main()
{
	ll m, n;
	scanf( "%lld%lld", &m, &n );

	printf( "%lld\n", powMod( m, n, mod ) );

	return 0;
}