#include <bits/stdc++.h>
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
const int m = 1999999973;

int main()
{
    unsigned int i,n,p;
    long long a, sol;
    fin>>n>>p;
    a = n;
    sol = 1;
    for(int i=0; (1<<i) <= p; i++) ///parcurgem toti bitii puterii p
    {
        if(((1<<i) & p) > 0) /// daca am gasit un bit care este 1, adaugam n^2^i la solutie
            sol = (sol * a) % m;
        a = (a * a) % m ; ///odata ce trecem la bit ul urmator trebuie sa reinnoim si baza
    }
    fout<<sol;
    return 0;
}