#include <iostream>
#include <cstdio>
using namespace std;

int mod = 1999999973;
long long f(long long n, long long p)
{
    if(p==1)
    {
        return n%mod;
    }
    if(p == 2)
    {
        return (n*n)%mod;
    }
    if(p%2==1)
    {
        long long x = f(n,p/2)%mod;
        return ((x*x%mod)*n)%mod;
    }
    else if(p%2==0)
    {
        long long x = f(n,p/2)%mod;
        return (x*x%mod);
    }

}

int main()
{
    freopen("lgput.in","r",stdin);
    freopen("lgput.out","w",stdout);
    long long n, p;
    scanf("%lld%lld",&n,&p);

    cout<<f(n%mod,p%mod);


    return 0;
}