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;
static const int INF = 1e+9 + 7;
long long n, m, l;
string s, t;
long long d[200010], dp[1010][1010];
double w[1000], v[1000];
double box[200010];
int main() {
  cin >> n >> m;
  cout << (pow(n, m)) << endl;
  return 0;
}
