#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>

#define ll long long
#define pb push_back
#define pii pair<int, int>
#define x first
#define y second

using namespace std;

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

const int MOD = 1999999973;
const char nl = '\n';

ll n, p;

ll lgput(ll n, ll p){
    ll ans = 1;
    while(p){
        if(p % 2 == 1)
            ans = (ans * n) % MOD;
        n = (n * n) % MOD;
        p = p / 2;
    }
    return ans;
}

int main()
{
    in >> n >> p;
    out << lgput(n, p) << nl;
    return 0;
}