#include <stdio.h>
#define mod 1999999973

using namespace std;

long long n;
long long p;

long long POW(long long x)
{
    return (x*x)%mod;
}

long long pow(long long p)
{
    if(p==1)
        return n%mod;
    if(p%2==0)
        return POW(pow(p/2))%mod;
    else
        return n*POW(pow((p-1)/2))%mod;
}

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


    return 0;
}