#include <cstdio>
#include <algorithm>
using namespace std;
int const MOD=1999999973;

long long  pow(long long x, long long k)
{
long long a=1;
  while(k)
  {
      if(k%2==1)
          a=(a*x)%MOD, k--;

      x=(x*x)%MOD;
      k=k/2;
  }
  return a;
}

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

    long long n,p;

    scanf("%lld%lld", &n, &p);

    printf("%lld", pow(n,p));

    return 0;
}