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 m;
long long Pow(long long n, long long now) {
  if (n == 1) {
    return m;
  }
  if (n % 2 == 1) {
    now *= m;
  }
  long long p = Pow(n / 2, now) % mod;
  return (p * p) % mod;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long n;
  cin >> m >> n;
  cout << Pow(n, 1) << endl;
  return 0;
}
