#include <iostream>
#include <fstream>

#define mod 1999999973

using namespace std;

ifstream fi("lgput.in");
ofstream fo("lgput.out");

long long n, p;

void solve();
long long lgput(long long n, long long p);

int main()
{
    
    solve();
    
    fi.close();
    fo.close();
    
    return 0;
}

void solve()
{
    fi >> n >> p;
    fo << lgput(n, p);
}

long long lgput(long long n, long long p)
{
    if (p == 1)
        return n % mod;
    
    long long half = lgput(n, p/2) % mod;

    if (p % 2 == 1)
        return ((((half%mod)  * (half%mod)) % mod) * n) % mod;
    else
        return ((half%mod)  * (half%mod)) % mod;
    
}