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;
const unsigned long long int m = 1000000007;
unsigned long long int power(unsigned long long int b, unsigned long long int p,
                             unsigned long long int m) {
  unsigned long long int d;
  if (p == 0) return 1;
  d = power(b, p / 2, m);
  if (p % 2 == 0)
    return (d * d) % m;
  else
    return (b % m * (d * d) % m) % m;
}
int main() {
  unsigned long long int a, b, d;
  scanf("%llu %llu", &a, &b);
  d = power(a, b, m);
  printf("%llu\n", d);
  return 0;
}
