欧拉定理:
a^b = a^(phi(m) + b%phi(m)) { mod m }
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>
#include<cmath>
#include<vector>
using namespace std;
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define nMax 1010
#define inf 0x7fffffff
#define LL long long
#define pb push_back
LL phi(LL n){
int m = (sqrt(n) + 0.5);
LL ans = n;
for(LL i=2;i<=m && i<n;i++) if(n%i == 0){
ans = ans / i * (i-1);
//cout<<n<<' '<<i<<' '<<ans<<endl;
while(n % i == 0) n/=i;
}
if(n>1) ans = ans / n * (n-1);
return ans;
}
LL EXP(LL a,LL n,LL mod){
if(n==0) return 1LL % mod;
LL k = EXP(a,n/2,mod);
k = k*k%mod;
if(n&1) k = k*a%mod;
return k;
}
LL f(LL p,LL n,LL mod){
if(n==1) return p%mod;
if(mod == 1 || p%mod == 0) return 0;
LL pm = phi(mod);//printf("pm=%lld\n",pm);
return EXP(p,pm+f(p,n-1,pm),mod);
}
void sovle(LL p,LL m){
LL k = m;
while(k-- > 1) m*=k;
LL last = f(p,1,m);
LL i = 2;
while(1){
LL now = f(p,i,m);
//printf("i = %lld now = %lld\n",i,now);
if(now == last) break;
i++;last=now;
}
printf("%lld\n",last);
return ;
}
int main(){
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
LL p , m;
bool first=true;
while(~scanf("%lld%lld",&p,&m)){
if(first) first = false;
else puts("");
sovle(p,m);
}
return 0;
}