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 <cstdio>

using namespace std;

#define MOD 1000000007
typedef long long ll;

ll power(ll a, ll b)
{
    if (b == 0) return 1;
    ll t = power(a, b/2) % MOD;
    t = t*t % MOD;
    if (b % 2 == 0) return t;
    return t*a % MOD;
}

int main()
{
    ll n, m;
    cin>>m>>n;
    cout<<power(m, n)<<"\n";
    return 0;
}