/*
*扩展欧拉函数+快速幂+(龟速乘)
*/
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
ll n, m, phi , t, b;
ll Pow(ll x,ll p){
if (p == 0) return 1ll;
ll tmp = Pow(x, p/2ll);
if (p & 1) return tmp * tmp % t * x % t;
else return tmp * tmp % t;
}
/*ll quick_mul(ll x,ll y,ll mod)
{
ll ans=0;
while(y!=0){
if(y&1==1)ans+=x,ans%=mod;
x=x+x,x%=mod;
y>>=1;
}
return ans;
}
ll quick_mul(ll a, ll b, ll mod){
return ((a*b-(long long)((long double)a*b/mod)*mod+mod)%mod);
}*/
ll quick_pow(ll x,ll y,ll mod)
{
ll sum=1 % mod;
while(y!=0){
if(y&1==1)sum=quick_mul(sum,x,mod),sum%=mod;
x=quick_mul(x,x,mod),x%=mod;
y=y>>1;
}
return sum % mod;
}
int main(){
scanf("%llu%llu", &n ,&m);
phi = m; t = m;
for (int i = 2; i <= sqrt(t); i++){
if (m % i == 0){
phi =phi * (i - 1) / i;
while (m % i == 0) m /= i;
}
if (m == 1) break;
}
if (m > 1) phi = phi * (m - 1) / m;
char c = getchar();bool f = 0;
while (!isdigit(c)) c = getchar();
while (isdigit(c)){
b = b * 10ll + (int)(c - '0');
if (b >= phi) f = 1;
b %= phi;
c = getchar();
}
if (f) b += phi;
printf("%lld\n", quick_pow(n, b, t));
return 0;
}