#include <bits/stdc++.h>
#define mod 1999999973

using namespace std;

ifstream f ("lgput.in");
ofstream g ("lgput.out");

int main()
{
    long long numar = 1 , n, p;
    f >> n >> p;
    while(p)
    {
        if(p % 2 == 0)
            n = (n * n) % mod, p /= 2;
        else numar = (1LL*numar * n) % mod, p--;
    }

    g << numar;
    return 0;
}