/************************************************************************/ | 求 a^n mod p p must be prime number /************************************************************************/ #include<iostream> using namespace std; int solve(int a, int n, int p) { int ret = 1; int x = n%p; for(int i=1; i<=x; i++) { ret = ret*a%p; if(ret==0) break; } return ret; } int main() { int a, n, p; while(scanf("%d%d%d", &a, &n, &p)!=EOF) { if(a==0) break; int ret = solve(a, n, p); printf("%d/n", ret); } return 0; }