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 cntne = 2, cntpre = 1;
inline unsigned long long int power(unsigned long long int l,
                                    unsigned long long int m,
                                    unsigned long long int n) {
  cntne *= 2;
  cntpre *= 2;
  m *= m;
  if (m > 1000000007) m %= 1000000007;
  if (cntne > n) {
    for (int i = cntpre; i < n; i++) {
      m *= l;
      if (m > 1000000007) m %= 1000000007;
    }
    return m % 1000000007;
  } else
    power(l, m, n);
}
int main() {
  unsigned long long int m, n;
  cin >> m >> n;
  cout << power(m, m, n) << endl;
  return 0;
}
