#include <fstream>
#include <iostream>

std::ifstream f("lgput.in");
std::ofstream g("lgput.out");
using big = long long;

const big toDiv = 1999999973;




big pow(big n, big p){
    if(p == 0){
        return 1;
    }
    if(p == 1){
        return n % toDiv;
    }
    big modN = n % toDiv;

    if(p % 2 == 0){
        return pow((modN * modN)%toDiv , p / 2) % toDiv;
    }

    return ( modN * (pow((modN * modN)%toDiv , p / 2) % toDiv)) % toDiv ;
    
}

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


int main(){

    big N, P;
    
    f >> N >> P;

    g << pow(N,P);

    

    f.close();
    g.close();
    
    return 0;  
}