#include <fstream>
using namespace std;
#define MOD 1999999973
long long int ridicare(long long int x, long long int p)
{
    if (p==0)
        return  1;
    else
        if (p==1)
        return  x ;
    else
        if(p%2==0)
        {
            return ridicare(x*x, p/2);
        }
        else
            return x*ridicare(x*x, (p-1)/2);
}
int main()
{
    long long int n, p, a, sol = 1;
    int i;
    ifstream g ("lgput.in");
    ofstream h ("lgput.out");
    g>>n>>p;
    //h<<ridicare(n, p)%1999999973;   nu mere pe nr mare
    a=n;
    for(i=0;(1<<i)<=p;++i)
    {
        if ( ((1<<i) & p) > 0) // p%2==1
            sol= (sol * a) % MOD;
        a=(a * a) % MOD; // p % 2 == 0
    }
    h<<sol;
    g.close();
    h.close();
    return 0;
}