#include<iostream>
#include<fstream>
#define mod 1999999973
using namespace std;

ifstream fin("lgput.in");
ofstream fout("lgput.out");

long long x,y,p;

inline void Citire()
{
    fin>>x>>y;
}

inline void Rezolva()
{
    p=1;
    while (y!=0)
        {
            if (y%2==1)
                {
                    y--;
                    p=(1LL*p*x)%mod;
                }
            x=(1LL*x*x)%mod;
            y>>=1;
        }
    p=p%mod;
    fout<<p<<"\n";
}


int main()
{
    Citire();
    Rezolva();
    //fout<<n<<" "<<p;
    return 0;
}