#include <iostream>
#include <cstring>
using namespace std;
typedef long long ll;

ll quickpow(ll x, ll y, ll z) {
    ll ans = 1;
    while (y) {
        if (y & 1)
            ans = ans * x % z;
        x = x * x % z;
        y >>= 1;
    }
    return ans;
}
ll phi(ll n) {
    ll rea = n;
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            rea = rea / i*(i-1);
            while (n % i == 0)
                n /= i;
        }
    }
    if (n > 1)
        rea = rea - rea / n;
    return rea;
}
char a[20000005];
int main() {
    ll x,z;
    cin>>x>>z>>a;
    ll len=strlen(a);
    ll p=phi(z);
    ll ans=0;
    for(int i=0;i<len;i++){
    	ans=(ans*10+a[i]-'0')%p;
	}
    ans+=p;
    cout<<quickpow(x,ans,z)<<endl; 
    return 0;
} 

萌新求调 不知道哪一步需要加什么特判