#include <algorithm>
using namespace std;

#define MOD 1999999973

unsigned int n,p;

void solve ()
{
    unsigned int rez;

    for (rez=1; p; p>>=1)
    {
        if (p&1)
            rez=(1LL*rez*n)%MOD;
        n=(1LL*n*n)%MOD;
    }
    printf ("%u",rez);
}

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

    scanf ("%u%u",&n,&p);
    solve ();

    return 0;
}