#include <cstdio>
#include <algorithm>
using namespace std;
#define Mod 1999999973

int n,k;
typedef long long ll;

ll pow(int k){
    if(k == 1)return n; else
    {
        ll v = pow(k/2);
        if(k%2) return (n*(v*v%Mod))%Mod; else
            return (v*v)%Mod;
    }
}

int main(){
    freopen("lgput.in","r",stdin);
    freopen("lgput.out","w",stdout);
        scanf("%d %d",&n,&k);
        printf("%lld\n",pow(k));
    return 0;
}