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 bpower(long long b, long long p, long long m) {
  if (p == 0) return 1;
  long long d = bpower(b, p / 2, m);
  if (p % 2 == 0) {
    return (d * d) % m;
  } else {
    return (((b * d) % m) * d) % m;
  }
}
int main() {
  long long fl, N, I, J, M, T, sum, d;
  cin >> M >> N;
  cout << bpower(M, N, 1000000009) << endl;
  return 0;
}
