//ALEX ENACHE

#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <cmath>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>
#include <chrono>

using namespace std;

//#include <iostream>
#include <fstream>
ifstream cin ("lgput.in");ofstream cout ("lgput.out");

const long long MOD = 1999999973;

long long lgput(long long n , long long p){
    long long ans = 1;
    while (p){
        if (p % 2){
            ans *= n;
            ans %= MOD;
        }
        n *= n;
        n %= MOD;
        p /= 2;
    }
    return ans;
}

int main() {

    //freopen("input", "r", stdin);freopen("output", "w", stdout);

    long long n , p;
    cin>>n>>p;
    cout<<lgput(n , p);


    return 0;
}