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 m = 1000000007;
int BigMod(int b, int p, int m) {
  if (p == 0) return 1;
  if (p % 2 == 1) {
    int part1 = b % m;
    int part2 = BigMod(b, p - 1, m);
    return (part1 * part2) % m;
  } else if (p % 2 == 0) {
    int part1 = BigMod(b, p / 2, m);
    return (part1 * part1) % m;
  }
}
int main() {
  int a, b;
  while (scanf("%d%d", &a, &b) == 2) {
    cout << BigMod(a, b, m) << endl;
  }
  return 0;
}
