#include <vector>
#include <fstream>
#include <bitset>
#include <queue>
using namespace std;

ifstream fin("lgput.in");
ofstream fout("lgput.out");
long long n, p;
const int mod = 1999999973;
long long put(long long a, long long b)
{
    long long p = 1;
    while (b)
    {
        if (b % 2 == 1)
            p = p * a % mod;
        a = a * a % mod;
        b /= 2;
    }
    return p;
}
int main()
{
    fin >> n >> p;
    long long x = put(n, p);
    fout << x;
    return 0;
}