#include <algorithm>
#include <iostream>

using namespace std;

long long mul(long long a, long long b, long long m) {
    if (b == 1)
        return a;
    if (b % 2 == 0) {
        long long t = mul(a, b / 2, m);
        return (2 * t) % m;
    }
    return (mul(a, b - 1, m) + a) % m;
}

long long FastPow(long long a, long long b, long long m) {
    if (b == 0)
        return 1;
    if (b % 2 == 0) {
        long long t = FastPow(a, b / 2, m);
        return mul(t, t, m) % m;
    }
    return (mul(FastPow(a, b - 1, m), a, m)) % m;
}

int main() {
    long int a, b, N = 1000000007;
    cin >> a >> b;
    long int ans = FastPow(a, b, N);
    cout << ans;
    return 0;
}