#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define vt vector
#define pb push_back
#define em emplace
#define emb emplace_back

#define all(x) x.begin(), x.end()
#define all1(x) x.begin() + 1, x.end()
#define sz(x) (int)(x).size()

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <class T> void re(vt <T>& x);
template <class T> void re(T& x) {
    cin >> x;
}

template <class H, class... T> void re(H &x, T&... y) {
    re(x); re(y...);
}

template <class T> void re(vt <T>& x) {
    for(auto& it : x)
        re(it);
}

template <class T> void wr(T x) {
    cout << x;
}

template <class H, class ...T> void wr(H x, T... y) {
    wr(x); wr(y...);
}

inline void Open(const string Name) {
    #ifndef ONLINE_JUDGE
        (void)!freopen((Name + ".in").c_str(), "r", stdin);
        (void)!freopen((Name + ".out").c_str(), "w", stdout);
    #endif
}

void solve() {
    const int MOD = 1999999973;
    auto lgput = [&](int a, int b) -> int {
        int res = 1;
        for(;b;b >>= 1) {
            if(b & 1)
                res = (ll)res * a % MOD;
            a = (ll)a * a % MOD;
        }
        return res;
    };
    int a, b; re(a, b);
    wr(lgput(a, b));
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    Open("lgput");

    int t = 1;
    for(;t;t--) {
        solve();
    }

    return 0;
}