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<cstdio>
#define int long long
int x=1000000007;
//a^b mod x
int mod(int a,int b)
{
    int ans=1;
    for(int i=0;i<30;i++)
    {
        if(b%2==1)ans=ans*a%x;
        a=a*a%x;
        b/=2;
    }
    return ans;
}


signed main()
{
    int m,n;
    scanf("%lld%lld",&m,&n);
    printf("%lld\n",mod(m,n));

    return 0;
}