// yukicoder: No.251 大きな桁の復習問題(1)
// 2019.4.14 bal4u

#include <stdio.h>

#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif
int ins(char *s)  // 文字列の入力 スペース以下の文字で入力終了
{
	char *p = s;
	do *s = gc();
	while (*s++ > ' ');
	*--s = 0;
	return s - p;
}

#define N       1000000000
int base[12000], pow[12000];

void mpStr2Num(int *num, int w, char *str)
{
	char *ss;
	int  *nn;
	int  k, x;

	if (*str == '0') { *num = 0; return; }
	ss = str + w;
	x = 0, k = 1, nn = num;
	do {
		x += (*--ss - '0') * k;
		k *= 10;
		if (k == N || ss == str) *++nn = x, x = 0, k = 1;
	} while (ss != str);
	*num = nn - num;
}

// 多倍長整数 za を 整数 ab で割ったあまり  = za % zb
int mpMod(int *za, int zb)
{
	int  i = *za;
	int  *aa = za + *za;
	int  ca = 0;
	long long x;

	while (i--) {
		x = (long long)N * ca + *aa--;
		ca = (int)(x % zb);
	}
	return ca;
}

#define MOD 129402307

char s[100005];

int bigPow(int x, int p)
{
	int r = 1;
	while (p) {
		if (p & 1) r = (long long)r * x % MOD;
		x = (long long)x * x % MOD;
		p >>= 1;
	}
	return r;
}

int main()
{
	int w, b, p;

	// Nの入力と処理
	w = ins(s);
	mpStr2Num(base, w, s);
	if (base[0] == 0) {	puts("0"); return 0; }
	if (base[0] == 1 && base[1] == 1) { puts("1"); return 0; }

	// Mの入力と処理
	w = ins(s);
	mpStr2Num(pow, w, s);
	if (pow[0] == 0) { puts("1"); return 0; }

	if ((b = mpMod(base, MOD)) == 0) { puts("0"); return 0; }
	p = mpMod(pow, MOD-1);

	printf("%d\n", bigPow(b, p));
	return 0;
}