#include <bits/stdc++.h>

using namespace std;

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

long long lgpow(unsigned long long n, unsigned long long p) {
    unsigned long long sol = 1;
    while (p) {
        if (p & 1)
            sol = (sol * n) % mod;
        p >>= 1;
        n = (n * n) % mod;
    }

    return sol;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    freopen("lgput.in", "r", stdin);
    freopen("lgput.out", "w", stdout);

    cin >> n >> p;
    cout << lgpow(n, p);
}