#include <iostream>
#include <fstream>
using namespace std;
long mod = 1999999973;
long long putere(long long n,long long p)
{
    if(p==1)
    {
        return n%mod;
    }
    else if(p==2)
    {
        return (n*n)%mod;
    }
    else if(p%2==0)
    {
        return (putere(n,p/2)*putere(n,p/2))%mod;
    }
    else if(p%2==1)
    {
        return (n*putere(n,p/2)*putere(n,p/2))%mod;
    }
}
int main()
{
    ifstream fin ("lgput.in");
    ofstream fout ("lgput.out");
    long long n,p;
    fin>>n>>p;
    fout<<(putere(n,p)%mod);
    return 0;
}