#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=205;
int n,k,p;
void add(int &x,int y){
	x=(x+y)%p;
	if(x<0) x+=p;
}
namespace case1{
	int f[N][N];
	int calc(int m,int d){
		memset(f,0,sizeof(f));
		f[0][0]=1;
		for(int i=0;i<m;i++){
			for(int j=0;j<=i;j++){
				if(j+1<=d) add(f[i+1][j+1],f[i][j]);
				add(f[i+1][0],f[i][j]);
			}
		}
		int ans=0;
		for(int j=0;j<=d;j++){
			add(ans,f[m][j]);
		}
		return ans;
	}
	void solve(){
		int cnt1=(n+1)/2-1;
		int cnt2=n/2;
		int ans=calc(cnt1,k/2)*calc(cnt2,k/2)%p;
		cout<<ans<<"\n";
	}
};
namespace case2{
	void solve(){
		
	}
};
void sol(){
	cin>>n>>k>>p;
	if(k%2==0){
		case1::solve();
	}
	else{
		case2::solve();
	}
}
signed main(){
	freopen("basket.in","r",stdin);
	freopen("basket.out","w",stdout);
	ios::sync_with_stdio(0),cin.tie(0);
	int ct=1;
	cin>>ct;
	while(ct--){
		sol();
	}
}