#include <iostream>
#include <fstream>
#define mod 1999999973
#define ll long long
using namespace std;
ifstream in("lgput.in");
ofstream out("lgput.out");
int n,p;
int exp(int a,int b)
{
    int cur=a,rez=1;
    for(int i=1;i<=b;i=i<<1)
    {
        if(b&i)
        {
            rez=(1LL*rez*cur)%mod;
        }
        cur=(1LL*cur*cur)%mod;
    }
    return rez;
}
int main()
{
    in>>n>>p;
    out<<exp(n,p);
    return 0;
}