#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

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

ll md = 129402307;
void solve() {
	string n, m; cin >> n >> m;
	if (m == "0") {
		cout << 1 << "\n"; return;
	}
	ll a = calc(n, md);
	if (a == 0) {
		cout << 0 << "\n";
		return;
	}
	ll b = calc(m, md - 1);
	ll ans = 1;
	while (b > 0) {
		if (b & 1)ans = ans * a % md;
		b >>= 1; a = a * a % md;
	}
	cout << ans << "\n";
}


signed main() {
	//ios::sync_with_stdio(false);
	//cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	//while (cin >> n >> m>>s1>>s2>>t, n)
	solve();
	return 0;
}