#include <bits/stdc++.h>
using namespace std;
#define mod 1999999973
unsigned long long n,p,ans;

int main()
{
    freopen("lgput.in","r",stdin);
    freopen("lgput.out","w",stdout);
    scanf("%d%d",&n,&p);
    ans = 1;
    while (p)
    {
        if (p&1) ans=(ans*n) % mod;
        n= (n % mod) * (n % mod) % mod;
        p>>=1;
    }
    printf("%d",ans);
}