#include <cstdio>
#define mod 1999999973

using namespace std;

long long n,p;

long long ridic(long long n,long long p)
{
    if(p==0)
        return 1;
    if(p%2==0)
    {
        long long a=ridic(n,p/2)%mod;
        return ((a%mod)*(a%mod))%mod;
    }
    if(p%2==1)
    {
        long long a=ridic(n,p/2)%mod;
        return (((a%mod)*(a%mod))%mod*(n%mod))%mod;
    }
}

int main()
{
    freopen("lgput.in","r",stdin);
    freopen("lgput.out","w",stdout);
    scanf("%d%d",&n,&p);
    printf("%d",ridic(n,p)%mod);
    return 0;
}