#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <cstring>
#include <cassert>
#define rf freopen("in.in", "r", stdin)
#define wf freopen("out.out", "w", stdout)
#define rep(i, s, n) for(int i=int(s); i<=int(n); ++i)
using namespace std;
const int mx = 1e5+10, mod = 1e9+7;

int C[111][111];
int dp[111][111];
int n, m, k, tests;

void pre_process()
{
	C[0][0] = 1%m;
	for(int i=1; i <=n; ++i)
	{
		C[i][0] = 1%m;
		for(int j = 1; j<=n; ++j)
			C[i][j] = (C[i-1][j-1] + C[i-1][j])%m;
	}
}

int modexpo(int b, int e)
{
	int ret = 1;
	while(e)
	{
		if(e&1)
			ret = (1ll*ret*b)%m;
		b = (1ll*b*b)%m;
		e >>= 1;
	}

	return ret;
}

int main()
{
	//rf;// wf;
	
	scanf("%d", &tests);
	while(tests--)
	{
		scanf("%d %d %d", &n, &k, &m);
		memset(dp, 0, sizeof dp);
		pre_process();

		dp[1][1] = 1%m;
		for(int i = 2; i<=n; ++i)
		{
			for(int j = 2; j<=i; ++j)
			{
				for(int l = 1; l<i; ++l)
				{
					dp[i][j] += (1ll*((1ll*C[i-1][l-1]*dp[l][1])%m)*(dp[i-l][j-1]%m))%m;
					dp[i][j] %= m;
				}
			}

			int calc = 0;
                	for (int j = 2; j <= i; ++j)
                    		calc = (calc + dp[i][j])%m;

                    	dp[i][1] = (modexpo(2, (i*(i-1))/2) - calc + m)%m;

		}

		cout << ((k == 1? (dp[n][k] + m - 1) % m : dp[n][k])) << endl;
	}
	return 0;
}