#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>

using namespace std;
using ull = unsigned long long;
using ll = long long;
using lli = long long int;
using ld = long double;
using pa = pair<int,int>;
#define SORT(v, n) sort(v, v+n);
#define ALL(v) v.begin(),v.end()
#define VSORT(v) sort(ALL(v))
#define GRESORT(v) sort(ALL(v),greater<ll>())
#define REVERSE(v) reverse(ALL(v))
#define overlap(v) v.erase(unique(ALL(v)),v.end())
#define debug(x) cout << #x << ": " << x << endl
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i = (b-1); i >= a; i--)
#define rrep(i,n) RFOR(i,0,n)
#define INF 999999999
#define mins(a,b) a = min(a,b)
#define maxs(a,b) a = max(a,b)

//4近傍
int dy[]={0, 1, 0, -1};
int dx[]={1, 0, -1, 0};

//8近傍
//int dy[]={0,0,1,-1,1,1,-1,-1};
//int dx[]={1,-1,0,0,1,-1,1,-1};

//ll mod = 1000000007;
ll mod = 129402307;

ll pow(ll x, ll n){
    ll tmp = 1;
    if(n>0){
        tmp = pow(x,n/2);
        if(n%2 == 0) tmp = (tmp*tmp) % mod;
        else tmp = (((tmp*tmp)%mod)*x) % mod;
    }
    return tmp;
}

void solve() {
    /*
    ll a,b,c;
    char x;
    cin >> a >> x >> b >> x >> c;
    cout << pow(pow(a,b),c) << " " << pow(a,pow(b,c)) << endl;
     */
    string x,y; cin >> x >> y;
    ll n = 0,m = 0;
    rep(i,x.size()) n = (n * 10 + x[i] - '0') % mod;
    rep(i,y.size()) m = (m * 10 + y[i] - '0') % (mod-1);
    //cout << n << endl;
    //cout << m << endl;
    if(n == 0 && m == 0 && y != "0") cout << 0 << endl;
    else cout << pow(n,m) << endl;
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);

    solve();

    return 0;
}