#include <iostream>
#include <fstream>
using namespace std;

#define modulo 1999999973

inline long long putere(long long n, long long p){

    if(p == 1)
        return n;

    if(p == 2)
        return (n*n) % modulo;

    if(p % 2 == 0)
        return ( (putere(putere(n,p/2),2)) % modulo );
    else
        return ( (n * putere(putere(n,(p-1)/2),2)) % modulo );
}

int main(){

    ifstream f("lgput.in");
    ofstream g("lgput.out");

    long long n, p, rez;

    f >> n >> p;

    rez = putere (n, p);

    g << rez << '\n';

    return 0;
}