#include <algorithm>
#include <iostream>
#include <fstream>
#define mod 1999999973

using namespace std;

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

long long putere(long long n, long long p)
{
    if(p == 1)
        return n;
    else
    {
        if(p%2==0) return  putere( (n*n) % mod , p/2 )  % mod;
        else return (n * putere((n*n) % mod , p/2)) % mod;
    }
}
int main()
{
    long long n, p;
    f >> n >> p;
    g << putere(n,p) << '\n';
}