#include <iostream>
#include <fstream>
#include <cmath>

using namespace std;

#define N 1999999973

long long putere( int n, int exp ){
	if( exp == 0 ) return 1;
	if( exp % 2 == 0 ){
		long long a = putere( n, exp / 2 );
		long long mod = a % N;
		return ( mod * mod ) % N ;
	}
	else{
		long long a =  putere( n, ( exp - 1 ) / 2 );
		long long mod = a % N;
		return ( ( n % N ) * ( ( mod * mod ) % N ) ) % N;
	}
}

int main(){
	ifstream in( "lgput.in" );
	ofstream out( "lgput.out" );
	int n, exp;
	in >> n >> exp;
	out << putere( n, exp );
	in.close();
	out.close();
	return 0;
}