#include <bits/stdc++.h>
#define mod 1999999973

using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
long long n, m;

void solve()
{
  f>>n>>m;
  long long result = 1;
  for(int i = 0;i < 32;++i)
    {
      if(m & (1 << i))
        result = (result * n) % mod;
      n = (n * n) % mod;    
    }
  g<<result;
}

int main()
{
  solve();
  return 0;
}