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 mod = 1e9 + 7;
long long bm(long long b, long long p, long long m) {
  if (p == 1 || p == 0) return b;
  if (p & 1) {
    return (b * bm(b, p - 1, m)) % m;
  } else {
    int r = bm(b, p / 2, m);
    return (r * r) % m;
  }
}
int main() {
  int m, n;
  cin >> m >> n;
  cout << bm(m, n, mod) << endl;
}
