#include <cstdio>

using namespace std;

const long long mod = 1999999973;

long long N , P;

long long fastpow(long long n , long long p)
{
    long long result = 1;

    for (int i = 0 ; (1 << i) <= p ; ++i)
    {
        if ((1 << i) & p) result = (result * n) % mod;
        n = (n * n) % mod;
    }

    return result;
}

int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);

scanf("%lld%lld",&N,&P);

printf("%lld",fastpow(N,P));

return 0;
}