1 #include<cstdio>
 2 typedef long long ll;
 3
 4 ll n,m,p;
 5
 6 ll ksm(ll b,ll tp,ll mod)
 7 {
 8     ll ret=1;
 9     while(tp)
10     {
11         if(tp&1)ret=ret*b%mod;
12         b=b*b%mod;
13         tp>>=1;
14     }
15     return ret;
16 }
17
18 ll mul(ll a,ll b,ll mod)
19 {
20     ll ret=0;
21     while(b)
22     {
23         if(b&1)ret=(ret+a)%mod;
24         a=(a+a)%mod;
25         b>>=1;
26     }
27     return ret;
28 }
29
30 ll exgcd(ll a,ll b,ll &x,ll &y)
31 {
32     if(!b)
33     {
34         x=1;y=0;
35         return a;
36     }
37     ll t=exgcd(b,a%b,y,x);
38     y-=a/b*x;
39 }
40
41 ll inv(ll x,ll mod)
42 {
43     ll a,b;
44     exgcd(x,mod,a,b);
45     return (a%mod+mod)%mod;
46 }
47
48 ll fac(ll x,ll pi,ll pk)
49 {
50     if(!x)return 1;
51     ll ans=1;
52     for(ll i=2;i<=pk;i++)
53         if(i%pi)ans=ans*i%pk;
54     ans=ksm(ans,x/pk,pk);
55     for(ll i=2;i<=x%pk;i++)
56         if(i%pi)ans=ans*i%pk;
57     return ans*fac(x/pi,pi,pk)%pk;
58 }
59
60 ll c(ll cn,ll cm,ll pi,ll pk)
61 {
62     if(cm>cn)return 0;
63     ll up=fac(cn,pi,pk),d1=fac(cm,pi,pk),d2=fac(cn-cm,pi,pk);
64     ll cnt=0;
65     for(ll i=cn;i;i/=pi)cnt+=i/pi;
66     for(ll i=cm;i;i/=pi)cnt-=i/pi;
67     for(ll i=cn-cm;i;i/=pi)cnt-=i/pi;
68     return up*inv(d1,pk)%pk*inv(d2,pk)%pk*ksm(pi,cnt,pk)%pk;
69 }
70
71 ll crt(ll a,ll pk)
72 {
73     return a*inv(p/pk,pk)%p*(p/pk)%p;
74 }
75
76 int main()
77 {
78     scanf("%lld%lld%lld",&n,&m,&p);
79     ll tp=p,ans=0;
80     for(ll i=2;i*i<=p;i++)
81     {
82         if(tp%i)continue;
83         ll pk=1;
84         while(!(tp%i))tp/=i,pk*=i;
85         ans=(ans+crt(c(n,m,i,pk),pk))%p;
86     }
87     if(tp>1)ans=(ans+crt(c(n,m,tp,tp),tp))%p;
88     printf("%lld",(ans%p+p)%p);
89     return 0;
90 }