/*
Author:Eraine
Contest:HB #6
Problem:lucky
Time:2025.2.6
Calm down!
Think carefully and type.
*/
#include<bits/stdc++.h>
#define ll long long
#define pi pair<int,int>
#define mkp(x,y) make_pair(x,y)
#define fi first
#define se second
#define lc tr[i].ch[0]
#define rc tr[i].ch[1]
#define Lc tr[j].ch[0]
#define Rc tr[j].ch[1]
#define REP(i,l,r) for(int i=(l);i<=(r);i++)
#define PER(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
inline int read(){
    int x=0,f=1;
    char c=getchar();
    while(!isdigit(c)){
        if(c=='-')f=-1;
        c=getchar();
    }
    while(isdigit(c)){
        x=(x<<3)+(x<<1)+c-'0';
        c=getchar();
    }
    return x*f;
}
void write(int x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const int N=2e6+5;
ll qpow(ll b,ll p,ll mod){
    ll res=1,x=b;
    for(ll w=1;w<=p;w<<=1){
        if(w&p)res=res*x%mod;
        x=x*x%mod;
    }
    return res;
}
int main(){
    int n=read(),s=read(),q=read(),res=0;
    REP(i,0,n-1)if((qpow(i,q,n)+1ll*i*q)%n==s)res+=i,res%=q;
    write(res),putchar('\n');
    return 0;
}