#include<fstream>
#define mod 1999999973
using namespace std;
long long n,k,p=1LL;
long long Putere_log()
{
    while(k)
    {
        if(k&1)//k este impar
        {
            p = (p % mod * n%mod)%mod;
            k--;
        }
        k >>= 1;//k/=2
        n *=n;
    }
    return p;
}
int main()
{
    ifstream fin("lgput.in");
    fin>>n>>k;
    fin.close();
    ofstream fout("lgput.out");
    fout<<Putere_log()<<"\n";
    fout.close();
    return 0;
}