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