#include <cstdio>

using namespace std;

#define modulo 1999999973

long long n, p, rez = 1;

int main(){

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

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

    for(int i = 0; (1<<i) <= p; ++i){

        if( ((1<<i) & p) > 0 )
            rez = (rez * n) % modulo;

        n = (n * n) % modulo;
    }

    printf("%lld", rez);

    return 0;
}