/*#include <iostream>
#include <fstream>

int hatvany(int a, int b){

    if(b == 2){
        return a*a;
    }
    else if(b%2 == 0){
        return hatvany(hatvany(a, b/2), 2);
    }
    else {
        return hatvany(hatvany(a, b/2), 2) * a;
    }
}

int main(){

    std::ifstream input("lgput.in");
    std::ofstream output("lgput.out");

    int a, b;
    input >> a >> b;

    output << hatvany(a, b);

    return 0;
}*/

#include <stdio.h>
#include <string.h>

const int n_max = 10001; // Definim numarul maxim de cifre al numerelor
const int m = 1999999973;

int main()
{
	unsigned int i, n, p;
	long long a, sol = 1;

	freopen("lgput.in","r",stdin);
	freopen("lgput.out","w",stdout);
	scanf("%d %d", &n, &p);
	a = n;
	for (i = 0; (1<<i) <= p; ++ i)  // Luam toti biti lui p la rand
	{
		if ( ((1<<i) & p) > 0) // Daca bitul i din p este 1 atunci adaugam n^(2^i) la solutie 
			sol= (sol * a) % m;
	
			a=(a * a) % m; // Inmultim a cu a ca sa obtinem n^(2^(i+1))
	}
	printf("%lld\n", sol); // Afisam solutia
}