#include <iostream>
#include <fstream>
using namespace std;

#define mod 1999999973

ifstream f("lgput.in");
ofstream g("lgput.out");

long long n , p;
long long rez=1;

long long calcul ( int x , int p )
{
    if ( p == 0 ) return 1;
    else
        if ( p%2 == 1 ) return x * calcul(x*x%mod , p/2 ) ;
            else return calcul(x*x%mod , p/2);
}

int main()
{
    f >> n >> p;
  /*  while(p>0)
    {
        if( p%2 == 1)
        {
            rez=rez*n%mod;
            p--;
        }
        else
        {
            n=(n*n)%mod;
            p/=2;
        }
    } */
    g << calcul(n,p);
    return 0;
}