1 //HDOJ 3037
 2 #include<cstdio>
 3 #include<cstdlib>
 4 #include<cstring>
 5 #include<iostream>
 6 #include<algorithm>
 7 #define rep(i,n) for(int i=0;i<n;++i)
 8 #define F(i,j,n) for(int i=j;i<=n;++i)
 9 #define D(i,j,n) for(int i=j;i>=n;--i)
10 using namespace std;
11 
12 int getint(){
13     int v=0,sign=1; char ch=getchar();
14     while(ch<‘0‘||ch>‘9‘) {if (ch==‘-‘) sign=-1; ch=getchar();}
15     while(ch>=‘0‘&&ch<=‘9‘) {v=v*10+ch-‘0‘; ch=getchar();}
16     return v*=sign;
17 }
18 /*******************tamplate********************/
19 const int N=100086;
20 typedef long long LL;
21 LL n,m,P,fac[N],inv[N],ans;
22 LL pow(LL a,LL b){
23     LL r=1,base=a;
24     for(;b;b>>=1,base=base*base%P)
25         if (b&1) r=r*base%P;
26     return r;
27 }
28 inline LL c(LL n,LL m){
29     if (n<m) return 0;
30     if (n<P && m<P){
31         LL a=1,b=1;
32         for(;m;m--,n--){
33             a=a*n%P;
34             b=b*m%P;
35         }
36         return a*pow(b,P-2)%P;
37     }
38     return c(n%P,m%P)*c(n/P,m/P)%P;
39 }
40 int main(){
41 //    freopen("input.txt","r",stdin);
42     int T=getint();
43     while(T--){
44         n=getint(); m=getint(); P=getint();
45         printf("%lld\n",c(n+m,m));
46     }
47     return 0;
48 }