/* -*- coding: utf-8 -*-
 *
 * 251.cc: No.251 大きな桁の復習問題(1) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

typedef long long ll;
const ll MOD = 129402307;

/* typedef */

/* global variables */

/* subroutines */

ll str2n_mod(string &s, ll mod) {
  ll r = 0;
  int n = s.size();

  for (int i = 0; i < n; i++)
    r = (r * 10 + (s[i] - '0')) % mod;

  return r;
}

ll powmod(ll a, ll b, ll mod = MOD) {  // a^b % MOD
  ll pm = 1;
  while (b > 0) {
    if (b & 1) pm = (pm * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return pm;
}

/* main */

int main() {
  string nstr, mstr;
  cin >> nstr >> mstr;

  ll n = str2n_mod(nstr, MOD);
  ll m = str2n_mod(mstr, MOD - 1);
  ll ans = powmod(n, m);

  if (n == 0 && m == 0) printf("%d\n", (mstr == "0") ? 1 : 0);
  else printf("%lld\n", ans);
  return 0;
}