#include <iostream>
#include <cstdio>
using namespace std;
int m=1999999973;
long long pu(long long n,long long p)
{
    if(p==1)
        return n%m;
    else if(p==2)
        return (n*n)%m;
    else if(p%2==0)
    {
        long long x=pu(n,p/2)%m;
        return (x*x)%m;
    }
    else if(p%2==1)
    {
        long long x=pu(n,p/2)%m;
        return (((x*x)%m)*n)%m;
    }
}
int main()
{
    freopen("lgput.in","r",stdin);
    freopen("lgput.out","w",stdout);
    long long n,p;
    scanf("%lld",&n);
    scanf("%lld",&p);
    printf("%lld",pu(n%m,p));
    return 0;
}