#include <bits/stdc++.h>
#define MOD 1999999973
#define ll long long
using namespace std;

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

int N, P;
int lgpow(int n, int p) {
    int ans = 1;
    while (p) {
        if (p % 2) ans = (1ll * ans * n) % MOD;
        n = (1ll * n * n) % MOD;
        p /= 2;
    }
      return ans;
}
int main()
{
    fin >> N >> P;
    fout << lgpow(N, P) << '\n';

    return 0;
}