#include <bits/stdc++.h>
#define MOD 1999999973
#define ll long long
using namespace std;
ifstream fin("lgput.in");
ofstream fout("lgput.out");
ll p1(ll a, ll n)
{
    ll p = 1;
    while(n > 0)
    {
        if(n % 2 == 1) p = p * a % MOD;
        n /= 2;
        a=a*a % MOD;
    }
    return p;
}
ll p2(ll a, ll n)
{
    ll p = 1 , i = 0;
    ll t[32];
    t[0] = a;
    for(i = 1; i <=30 ; i++)
        t[i] = t[i-1] * t[i - 1 ] % MOD;
    i = 0;
    while(n > 0)
    {
        if(n % 2 == 1 )p = p * t[i] % MOD;
        n /= 2;
        i++;
    }
    return p ;
}
int main()
{
    ll a , n;
    fin >> a >> n;
    fout<<p2(a,n) << "\n";
    fin.close();
    fout.close();
    return 0;
}