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