#include <bits/stdc++.h>
#define ll long long
#define MOD 1999999973

using namespace std;

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

ll fast_pow(ll n, ll p) {
    ll ans = 1;
    int lim = 64 - __builtin_clzll(p);

    for (int i = 0; i <= lim; i++) {
        if (p & (1ll << i)) {
            ans = (ans * n) % MOD; 
        }

        n = (n * n) % MOD;
    }

    return ans; 
}

int main() {
    ll n, p; 
    in >> n >> p;

    out << fast_pow(n, p);

    return 0;
}