#include <cstdio>

#include <iostream>

#include <cstring>

#include <algorithm>

using namespace std;

#define ll long long

#define inv(a) Inv(a, P)

#define mult(a, b) Mult(a, b, P)

const int MAX_N = 200010;

ll Fact[MAX_N];

ll P;

void GetFact(int n, ll* Fact, ll p)

{

	Fact[0] = 1;

	for (int i = 1; i <= n; i++)

		Fact[i] = Fact[i - 1] % p * i % p;

}

ll Exgcd(ll a, ll b, ll& x, ll& y)

{

	if (b == 0)

	{

		x = 1;

		y = 0;

		return a;

	}

	ll d = Exgcd(b, a%b, x, y);

	ll tx = x;

	x = y;

	y = tx - a / b * y;

	return d;

}

ll Inv(ll a, ll p)

{

	ll x, y;

	Exgcd(a, p, x, y);

	return (x % p + p) % p;

}

ll Mult(ll a, ll b, ll p)

{

	ll ans = 0;

	while (b)

	{

		if (1 & b)

			ans = (ans + a) % p;

		a = (a + a) % p;

		b >>= 1;

	}

	return ans;

}

ll Comb(ll n, ll m)

{

	if (m > n)

		return 0;

	return mult(Fact[n], inv(mult(Fact[m], Fact[n - m])));

}

ll Lucas(ll n, ll m, ll p)

{

	if (m == 0)

		return 1;

	return Comb(n % p, m % p) * Lucas(n / p, m / p, p) % p;

}

int main()

{

	int caseCnt;

	scanf("%d", &caseCnt);

	while (caseCnt--)

	{

		ll n, m;

		scanf("%lld%lld%lld", &n, &m, &P);

		GetFact(n + m, Fact, P);

		printf("%lld\n", Lucas(n + m, m, P));

	}

	return 0;

}