#include <bits/stdc++.h>
#define modulo 1999999973
using namespace std;

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

long long s = 1;
int p;
int n;

void Citire()
{
    fin >> n >> p;
}

void Ridica()
{
    while(p > 0)
    {
        if(p % 2 == 1)
        {
            s = (1LL * s * n) % modulo;
            p--;
        }
        p /= 2;
        n = (1LL * n * n) % modulo;
    }

    fout << s << "\n";
}
int main()
{
    Citire();
    Ridica();
    return 0;
}