#include <fstream>

using namespace std;

ifstream cin("lgput.in");
ofstream cout("lgput.out");

int modulo = 1999999973;

unsigned long long lgput(unsigned long long n, unsigned long long k)
{
    if(k == 0)
        return 1;
    if(k == 1)
        return n;
    if(k % 2 == 0)
        return (lgput(n, k / 2) * lgput(n, k / 2)) % modulo;
    else
        return (lgput(n, (k-1) / 2) * lgput(n, (k-1) / 2)) % modulo;
}

int main()
{
    unsigned long long n, k, nc;
    unsigned long long sol = 1;
    cin >> n >> k;
    /*nc = n;
    for (int i = 0; (1 << i) <= k; i++)
    {
        if (((1 << i) & k) > 0)
        {
            sol = (sol * nc) % modulo;
        }
        nc = (nc * nc) % modulo;
    }*/
    cout<<lgput(n, k);
    return 0;
}