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;
long long int Pow(long long int n, long long int m) {
  if (m == 0) return 1;
  if (m == 1) return n;
  if (m % 2) return (m * Pow((n * n) % 1000000007, m / 2)) % 1000000007;
  return Pow((n * n) % 1000000007, m / 2) % 1000000007;
}
int main() {
  int n, m;
  cin >> n >> m;
  cout << Pow(n, m) << endl;
}
