#include<fstream>
using namespace std;

ifstream f("lgput.in");
ofstream g("lgput.out");

int mod=1999999973,n,p;

int putere(int n,int p)
{
    int rest=1;
    while(p!=0)
    {
        if(p%2==1)
            rest=(1LL*rest*n)%mod;
        n=(1LL*n*n)%mod;
        p/=2;
    }
    return rest;
}
long long lg(int n, int p)
{
    int s=0,y=0;
    if(p==0)
        return 1;
    if(p==1)
        return n%mod;
    if(p%2==0)
    {
        y=putere(n,p/2);
        s=(y*y)%mod;
    }
    else
        s=(putere(n,p-1)*n)%mod;

    return s;
}
int main()
{
    f>>n>>p;
    g<<lg(n,p);
    return 0;
}