#include<bits/stdc++.h>
#define reg register int
#define il inline
#define int long long
#define numb (ch^'0')
using namespace std;
typedef long long ll;
il void rd(int &x){char ch;x=0;bool fl=false;while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true);for(x=numb;isdigit(ch=getchar());x=x*10+numb);(fl==true)&&(x=-x);
}
namespace Miracle{
ll p;
ll qm(ll x,ll y,ll pk){x%=pk;ll ret=1;while(y){if(y&1) ret=(ret*x)%pk;x=(x*x)%pk;y>>=1;}return ret;
}
ll calc(ll n,ll pi,ll pk){//计算阶乘部分 （质因子已经提前处理这里不予考虑） if(!n) return 1;ll res=1;for(reg i=2;i<pk;++i)//每个循环节 if(i%pi) res=(res*i)%pk;res=qm(res,n/pk,pk);for(reg i=2;i<=n%pk;++i)if(i%pi) res=(res*i)%pk;return res*calc(n/pi,pi,pk)%pk;
}
void exgcd(ll a,ll b,ll &x,ll &y){//exgcdif(!b){x=1,y=0;return;}exgcd(b,a%b,y,x);y-=(a/b)*x;
}
ll inv(ll n,ll pk){//逆元
    ll x,y;exgcd(n,pk,x,y);x=(x%pk+pk)%pk;return x;
}
ll C(ll n,ll m,ll pi,ll pk){//计算C(n,m)mod pi^k ll up=calc(n,pi,pk),d1=calc(m,pi,pk),d2=calc(n-m,pi,pk);ll k=0;for(reg i=n;i;i/=pi) k+=i/pi;//处理质因子个数 for(reg i=m;i;i/=pi) k-=i/pi;for(reg i=n-m;i;i/=pi) k-=i/pi;return up*inv(d1,pk)%pk*inv(d2,pk)%pk*qm(pi,k,pk)%pk;
}ll CRT(ll b,ll mod){//CRT每步算出来了之后直接合并 return (b*inv(p/mod,mod)%p*(p/mod))%p;
}
ll EXLUCAS(ll n,ll m){//质因数分解+开始处理C ll ret=0;ll tmp=p;for(reg i=2;(ll)i*i<=tmp;++i){if(tmp%i==0){ll pi=i,pk=1;while(tmp%i==0) pk*=i,tmp/=i;(ret+=CRT(C(n,m,pi,pk),pk))%=p;}}if(tmp>1) (ret+=CRT(C(n,m,tmp,tmp),tmp))%=p;return ret;
}
int main(){ll n,m;scanf("%lld%lld%lld",&n,&m,&p);printf("%lld",EXLUCAS(n,m));return 0;
}}
signed main(){Miracle::main();return 0;
}/*Author: *Miracle*Date: 2018/12/1 8:44:42
*/