#include <iostream>
#include <fstream>
using namespace std;

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

const int mod = 1999999973;
long long n, p;

long long pow() {
    long long rez = 1;
    while(p) {
        if(p & 1) {
            rez = (rez * n) % mod;
        }
        n = (n * n) % mod;
        p /= 2;
    }
    return rez;
}

int main()
{
    cin >> n >> p;
    cout << pow();
}