#include <cstdio>

#define mod 1999999973

using namespace std;

long long n,p,r;

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

    scanf ("%lld %lld",&n,&p);
    r=1;

    while (p>1)
        if (p%2 == 1)
        {
            r = (r*n) % mod;
            p-=1;
        }
        else
        {
            n = ( n * n ) % mod;
            p/=2;
        }

    printf ("%lld\n",(n*r)%mod);

    return 0;
}