#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

using namespace std;
ifstream fin ("lgput.in");
ofstream fout ("lgput.out");

#define MOD 1999999973

long long n, p;

long long putere( int p )
{
    if ( p == 1 )
    {
        return n % MOD;
    }
    else
    {
        long long x;
        x = putere( p / 2 );
        if ( p % 2 == 0 )
            return ( x * x ) % MOD;
        return ( x * (( x * ( n % MOD ) ) % MOD) ) % MOD;
    }
}

int main ()
{
    fin >> n >> p;
    fout<< putere( p );
}