#include <cstdio>
#include <list>

using namespace std;

int n;
int p;
const int MOD = 1999999973;

void solve() {
  scanf("%d %d", &n, &p);
  // 10010
  int temp = p;
  long long result = 1;
  long long x = n;
  while (temp) {
    if (temp % 2 != 0) {
      result = (result * x) % MOD;
    }  
    x = (x * x) % MOD;
    temp /= 2;
  }
  printf("%ld\n", result);
}

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

  solve();
  return 0;
}