#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

ll strmod(const string& n, const ll& m){
  ll ret = 0;
  int j = 0;
  while(true){
    if(ret >= m) ret%=m;
    if(j >= n.size()) break;
    ret = ret*10 + (n[j]-'0');
    j++;
  }

  return ret;
}


ll mod_pow(ll x, ll n, ll mod){
  ll res = 1;
  while(n>0){
    if(n&1) res = res*x%mod;
    x = x*x%mod;
    n >>= 1;
  }
  return res;
}

int main(){
  ios::sync_with_stdio(false);
  
  string sN, sM;
  cin >> sN >> sM;

  if(sN == "0"){
    cout << 0 << endl;
    return 0;
  }

  if(sM == "0"){
    cout << 1 << endl;
    return 0;
  }
  
  ll res1 = strmod(sN, 129402307LL);
  ll res2 = strmod(sM, 129402306LL);
  //cout << res1 << " " << res2 << endl;
  if(res2 == 0){
    if(res1 == 0){
      cout << 0 << endl;
    }else{
      cout << 1 << endl;
    }
  }else{
    cout << mod_pow(res1, res2, 129402307LL) << endl;
  }
  return 0;
}