#include<map>
#include<cmath>
#include<cstdio>
#include<iostream>

using namespace std;

map<int,int>mp;

int Pow(int a,int b,int p)
{
    int res=1;
    for(;b;a=1LL*a*a%p,b>>=1)
        if(b&1) res=1LL*res*a%p;
    return res;
}

long long Mul(long
 
 long a,int b,long long p)
{
    long long res=0;
    while(b)
    {
        if(b&1) res+=a,res%=p;
        b>>=1; a+=a; a%=p;
    }
    return res;
}        

bool Legendre(int n,int p)
{
    return Pow(n,p-1>>1,p)+1!=p;
}

int bsgs(int a,int b,int p)
{
    mp.clear();
    
 
int m=sqrt(p);
    mp[b]=0;
    for(int i=1;i<=m;++i)
    {
        b=1LL*a*b%p;
        mp[b]=i;
    }
    int am=Pow(a,m,p);
    int mul=1;
    for(int i=1;i<=m;++i)
    {
        mul=1LL*mul*am%p;
        if(mp.find(mul)!=mp.end()) return i*m-mp[mul];
    }
    return -1;
}

 
int inv(int a,int p)
{
    return Pow(a,p-2,p);
}

int main()
{
    freopen("theory.in","r",stdin);
    freopen("theory.out","w",stdout);
    int x,m,p;
    scanf("%d%d%d",&x,&m,&p);
    if(p==2) printf("1");
    int y;
    long long ans;
    for(int g=1;;++g)
    {
        if(!Legendre(x-Pow(g,m,p),p)) continue; 
        y=bsgs(g,(x-Pow(g,m,p)+p)%p,p);
        if(y==-1 || (y&1)) continue;
        long long P=1LL*p*(p-1);
        ans=Mul(1LL*(p-1)*inv(p-1,p)%P,g,P)+1LL*p*(y/2)%P;
        ans%=P;
        cout<<ans;
        return 0;
    }
}