#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("lgput.in");
ofstream out("lgput.out");
 
int main()
{
    
   long long n, p, r=1, modulo=1999999973;
   in>>n>>p;
 
    while (p!=1)
    {
        if (p%2!=0)
            {
            r =(r * n) % modulo;
            p=(p-1);
                
            }
        else 
            {
            n=n*n;
            n=n%modulo;
            p=p/2;
                
            }
        
    }
    n = (n * r) % modulo;
    out<<n;
return 0;
}