#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define itall(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-8;
template<typename T> inline T sq(T a) { return a * a; }
template<typename T> inline T cb(T a) { return a * a * a; }
template<typename T> inline bool umin(T &a, const T &b) { return b < a && (a = b, true); }
template<typename T> inline bool umax(T &a, const T &b) { return a < b && (a = b, true); }

const ll MOD = 129402307;

ll modulo(string s, ll m) {
    ll p = 1;
    ll res = 0;
    rep (i, s.length()) {
        (res += (s[s.length() - i - 1] - '0') * p) %= m;
        (p *= 10) %= m;
    }
    return res;
}

ll modpow(ll a, ll b, ll m) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % m;
        a = a * a % m;
        b >>= 1;
    }
    return res;
}

int main() {
    string N, M;
    cin >> N >> M;

    ll n = modulo(N, MOD);
    ll m = modulo(M, MOD - 1);

    ll ans = modpow(n, m, MOD);
    if (M == "0") ans = 1;
    if (n == 0) ans = 0;
    cout << ans << endl;
}