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 a[31] = {};
long long c[31] = {};
int main() {
  long long m, n;
  cin >> m >> n;
  int max = 0, e = n;
  for (int i = 30; i >= 0; i--) {
    a[i] = e / (long long)pow(2, i);
    e = e % (long long)pow(2, i);
    if (a[i] == 1 && max == 0) max = i;
  }
  long long k = 1, b = m;
  int l = 0;
  while (l < max) {
    b = b * b;
    k = k * 2;
    l++;
    if (b > 1000000007) b = b % 1000000007;
    c[l] = b;
  }
  for (int i = 0; i < max; i++) {
    if (a[i] == 1) b = b * c[i];
    if (b > 1000000007) b = b % 1000000007;
  }
  cout << b << endl;
}
