#include <bits/stdc++.h>

using namespace std;

#define mod 1999999973 
ifstream f("lgput.in");
ofstream g("lgput.out");

long long x, y;

void read() {
  f>>x>>y;
}

void solve() {
  long long result = 1;
  long long put = x;

  for(int i = 0;i < 32;++i) {
    if(y & (1 << i)) {
      result = (result * put) % mod;
    }
    put = (put * put) % mod;
  }

  g<<result;
}

int main() {
  
  read();
  solve();

  return 0;
}