#include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 ll a,c,p,mod;

 char t[];

 ll phi(ll n)

 {

     ll res=n;

     for(int i=;i*i<=n;i++){

         if(n%i==){

             res=res/i*(i-);

             while(n%i==)

                 n/=i;

         }

     }

     if(n>)

         res=res/n*(n-);

     return res;

 }

 ll quickpower(ll a,ll b,ll c)

 {

     ll ans=;

     while(b)

     {

         if(b&)

             ans=(ans*a)%c;

         a=(a*a)%c;

         b>>=;

     }

     return ans;

 }

 int main()

 {

     while(~scanf("%lld%s%lld",&a,t,&c)){

         int len=strlen(t);

         ll p=phi(c);

         ll ans=;

         for(ll i=;i<len;i++)

             ans=(ans*+t[i]-'')%p;

         ans+=p;

         printf("%lld\n",quickpower(a,ans,c));

     }

 }