#include <bits/stdc++.h>

using namespace std;

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

const int mod = 1999999973;

long long pw(long long a, long long n){
    long long ans = 1;
    while(n > 0){
        if(n % 2 == 1){
            ans = (ans * a) % mod;
        }
        a = (a * a) % mod;
        n /= 2;
    }
    return ans;
}

int main()
{
    int a, b;
    f >> a >> b;
    g << pw(a,b);
}