#include <iostream>
#include <fstream>
#include <algorithm>


using namespace std;

const long long MOD = 1999999973;

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

int Pow(int x, int n)
{
    int p = 1;

    while (n)
    {
        if (n & 1)
            p = (1ll * p * x) % MOD;

        x = (1ll * x * x) % MOD;
        n >>= 1;
    }

    return p;
}

int main()
{
    int x, n;
    fin >> x >> n;
    fout << Pow(x, n);
}