#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;

const long long mod = 1999999973;

long long n, p;
ifstream fin("lgput.in");
ofstream fout("lgput.out");


long long fastPow(long long a, long long b)
{
    long long ans = 1;
    while(b)
    {
        if(b&1)
        {
            b--;
            ans = (ans*a)%mod;
        }

        b/=2;
        a = (a*a)%mod;
        //cout << ans << "\n";
    }
    return ans;
}


long long fastPw(long long a, long long b)
{
    if(b == 0) return 1;
    if(b&1) return (a*fastPw(a, b-1))%mod;
    return (fastPw(a, b/2)*fastPw(a, b/2))%mod;

}
int main()
{
    fin >> n >> p;
    fout << fastPw(n, p);
}