#include <iostream>
#include <fstream>

using namespace std;

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

const int MOD = 1999999973;

long long n, p, sol = 1;

int main()
{
  in >> n >> p; // (n ^ p) % MOD

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

  out << sol << '\n';

  in.close();
  out.close();
  return 0;
}