#include <cstdio>
#define mod 1999999973

using namespace std;

long long n;
long long p;

long long pow (long long p){
    if (p == 1){
        return n;
    }
    long long x = pow (p / 2);
    x = x * x % mod;
    if (p % 2 == 0){
        return x;
    }
    return x * n % mod;

}

int main()
{
    freopen ("lgput.in", "r", stdin);
    freopen ("lgput.out", "w", stdout);
    scanf ("%lld %lld", &n, &p);
    printf ("%lld", pow(p));

    return 0;
}