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

const int dim= 1999999973;
long long n, p;

long long ex_rap(long long nr)
{
    if(nr== 0)
        return 1;
    else
    if(nr% 2== 0)
    {
        long long prod= ex_rap(nr/ 2);
        return (1LL* prod* prod)% dim;
    }
    else
    {
        long long prod= ex_rap(nr/ 2);
        return (1LL* prod* prod* n)% dim;
    }
}

int main()
{
    int i;
    cin >> n>> p;
    cout << ex_rap(p)% dim;


    return 0;
}