#include <iostream>
#include <fstream>

#define mod 1999999973
using namespace std;

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



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

int main()
{
    long long P=1;
    int baza,exp;
    fin>>baza>>exp;
    P = recursiv(baza,exp);
    fout<<P;
    return 0;
}