#include <iostream>
#include <fstream>
#include <vector>
#define mod 1999999973
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
int n,p,sol=1;

void ridicare(int p)
{
    while(p)
        if(p%2==1)
    {
            sol=n*sol;
            sol=sol%mod;
            n=(n*n)%mod;
            p=p/2;
    }
    else
    {
        sol=n*sol;
        sol=sol%mod;
        p--;
    }

}
int main()
{
        fin>>n>>p;
        ridicare(p);

        fout<<sol%mod;
    return 0;
}