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"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;

using ll = long long;

int main() {
    ll m, n, ans = 1, MOD = 1e9 + 7;
    cin >> m >> n;
    while (n > 0) {
        if (n & 1) ans = (ans * m) % MOD;
        n /= 2;
        m = (m * m) % MOD;
    }
    cout << ans << "\n";
}
