#include <bits/stdc++.h>

#define ll long long
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");

const int mod = 1999999973;

ll n,p;

ll lgpow(ll x,ll p){
    ll r = 1;
    while(p){
        if(p & 1){
            p--;
            r = (r * x) % mod;
        }
        x = (x * x) % mod;
        p /= 2;
    }
    return r;
}
int main()
{
    f >> n >> p;
    g << lgpow(n,p) << '\n';
    return 0;
}