#include <iostream>
#include <fstream>

unsigned long long Q = 1999999973

using namespace std;

int main()
{
    unsigned long long n, p;

    // open files
    freopen("lgput.in", "r", stdin);
    freopen("lgput.out", "w", stdout);

    // read input
    cin >> n >> p;

    // solve
    unsigned long long m = 1;
    while (p > 1)
    {
        if (p % 2 == 0)
        {
            n = ((n % Q) * (p % Q)) % Q;
            p /= 2;
        }
        else
        {
            m = ((m % Q) * (n % Q)) % Q;
            n = ((n % Q) * (n % Q)) % Q;
            p = (p - 1) / 2;
        }
    }
    n = ((n % Q) * (m % Q)) % Q;

    // write output
    cout << n;

    return 0;
}