#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define MOD 1999999973

long long n;
int p;

long long pow(int p) {
    if (p == 0) {
        return 1;
    } else
    if (p == 1) {
        return n;
    } else {
        long long r = pow(p/2);
        if (p % 2) {
            return (r * r) % MOD * n % MOD;
        } else {
            return (r * r) % MOD;
        }
    }
}

int main() {
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);

    cin >> n >> p;
    cout << pow(p);

    return 0;
}