#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <cstring>

using namespace std;

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

long long n,x;
const int m =1999999973;

int lgput(int baza, int exponent){
    if (exponent==1)
        return baza%m;
    int rez=lgput(baza,exponent/2)%m;
    if (exponent%2==0)
        return (rez*rez)%m;
    else
        return (rez*rez*baza)%m;
}

int main(){
    f>>n>>x;
    cout<<lgput(n,x)%m;
    return 0;
}