#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <bitset>
#include <cmath>
#define mod 1999999973
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");

long long N, k;

long long log_pow(long long baza, long long exp)
{
    long long res=1;
    while (exp>1)
    {
        if (exp%2) res*=baza;
        baza*=baza; res%=mod;
        baza%=mod; exp/=2;
    }
    g<<res<<'\n';
}

int main()
{
    f>>N>>k;
    log_pow(N, k);
    return 0;
}