#include <iostream> #include <vector> #include <algorithm> #include <cmath> #include <queue> #include <string> #include <map> #include <set> #include <stack> #include <tuple> #include <deque> #include <array> #include <numeric> #include <bitset> #include <iomanip> #include <cassert> #include <chrono> #include <random> #include <limits> #include <iterator> #include <functional> #include <sstream> #include <fstream> #include <complex> #include <cstring> #include <unordered_map> #include <unordered_set> using namespace std; using ll = long long; constexpr int INF = 1001001001; constexpr int mod = 1000000007; // constexpr int mod = 998244353; template<class T> inline bool chmax(T& x, T y){ if(x < y){ x = y; return true; } return false; } template<class T> inline bool chmin(T& x, T y){ if(x > y){ x = y; return true; } return false; } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); string s, t; cin >> s >> t; if(s == "0"){ cout << 0 << endl; return 0; } if(t == "0"){ cout << 1 << endl; return 0; } int ns = s.length(), nt = t.length(); constexpr int p = 129402307; ll n = 0; for(int i = 0; i < ns; ++i){ n = (n * 10 + (s[i] - '0')) % p; } ll m = 0; for(int i = 0; i < nt; ++i){ m = (m * 10 + (t[i] - '0')) % (p - 1); } ll ans = n > 0; while(m > 0){ if(m & 1) (ans *= n) %= p; (n *= n) %= p; m >>= 1; } cout << ans << endl; return 0; }