#include <iostream>
#define MOD 1999999973
using namespace std;
int solve(int n, int p)
{
    long long ans = 1;
    for(; p; p >>= 1) {
        if((p & 1) == 1) ans = (1LL * ans * n) % MOD;
        n = (1LL * n * n) % MOD;
    }
    return ans % MOD;
}
int main()
{
    freopen("lgput.in", "r", stdin);
    freopen("lgput.out", "w", stdout);
    int n, p;
    scanf("%d%d", &n, &p);
    printf("%d", solve(n, p));
    return 0;
}