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;
int main() {
  long long a, b;
  int m, n;
  cin >> m >> n;
  int c[n];
  a = m;
  b = 1000000007;
  for (int i = 1; i < n; i++) {
    a = a * m;
    if (a >= b) {
      a = a % b;
    }
    if (a == m) {
      n = n % i;
      i = 0;
    }
    if (a == 1) {
      break;
    }
  }
  cout << a << endl;
  return 0;
}
