/// recursiv
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1999999973;
int n,a;

ifstream fin("lgput.in");
ofstream fout("lgput.out");

int lgput(int n, int a){
    if(a == 0){
        return 1;
    }else{
        if(a%2 == 0){
            int val = lgput(n, a/2);
            return (val*val)%MOD;
        }else{
            return (n*lgput(n, a-1))%MOD;
        }
    }
}

signed main()
{
    fin >> n >> a;
    fout << lgput(n, a);
    return 0;
}