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
public class Main {

  private static long power(long m, long n) {
    long res;
    long MODE = 1000000007;

    if (n == 0) {
      return 1;
    }
    res = power(m * m % MODE, n / 2);
    if (n % 2 == 1) {
      res = res * m % MODE;
    }
    return res;
  }

  public static void main(String[] args) {

    ArrayList inputs = new ArrayList();
    for (String string : args) {
      inputs.add(string);
    }

    long m = Long.parseLong((String) inputs.get(0));
    long n = Long.parseLong((String) inputs.get(1));

    System.out.println(power(m, n));
  }

}