#include <string> #include <vector> #include<iostream> #include<cstdio> #include<cstdlib> #include<stack> #include<queue> #include<cmath> #include<algorithm> #include<functional> #include<list> #include<deque> #include<bitset> #include<set> #include<map> #include<unordered_map> #include<cstring> #include<sstream> #include<complex> #include<iomanip> #include<numeric> #define X first #define Y second #define pb push_back #define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X)) #define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X)) #define repe(X,Y) for ((X) = 0;(X) < (Y);++(X)) #define peat(X,Y) for (;(X) < (Y);++(X)) #define all(X) (X).begin(),(X).end() #define rall(X) (X).rbegin(),(X).rend() #define eb emplace_back #define UNIQUE(X) (X).erase(unique(all(X)),(X).end()) using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; template<class T> using vv=vector<vector<T>>; template<class T> ostream& operator<<(ostream &os, const vector<T> &t) { os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;} template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";} const ll MOD=129402307; ll modpow(ll r,ll n,ll m=MOD){ ll re=1,d=r%m; for(n=(n%(m-1)+m-1)%(m-1);n;n/=2){ if(n&1)(re*=d)%=m; (d*=d)%=m; } return re; } ll fun(string str,int m){ ll re=0; for(char c:str){ (re*=10)%=m; (re+=c-'0')%=m; } //cout<<str<<":"<<re<<endl; return re; } int main(){ ios_base::sync_with_stdio(false); cout<<fixed<<setprecision(0); string a,b; cin>>a>>b; if(b=="0"){ cout<<1<<endl; return 0; } ll n=fun(a,MOD),r=fun(b,MOD-1); cout<<(n?modpow(n,r):0)<<endl; return 0; }