#include<bits/stdc++.h>

#define reg register int

#define il inline

#define fi first

#define se second

#define mk(a,b) make_pair(a,b)

#define numb (ch^'0')

using namespace std;

typedef long long ll;

template<class T>il void rd(T &x){

    char ch;x=;bool fl=false;

    while(!isdigit(ch=getchar()))(ch=='-')&&(fl=true);

    for(x=numb;isdigit(ch=getchar());x=x*+numb);

    (fl==true)&&(x=-x);

}

template<class T>il void output(T x){if(x/)output(x/);putchar(x%+'');}

template<class T>il void ot(T x){if(x<) putchar('-'),x=-x;output(x);putchar(' ');}

template<class T>il void prt(T a[],int st,int nd){for(reg i=st;i<=nd;++i) ot(a[i]);putchar('\n');}

namespace Miracle{

int f[][(+)*+];

int n,k,p;

int main(){

    int t;

    rd(t);

    while(t--){

        rd(n);rd(k);rd(p);

        memset(f,,sizeof f);

        f[][]=;

        for(reg j=;j<=(n+)*k;++j){

            for(reg i=;i<=min(k,j);++i){

                f[i][j]=(f[i][j-i]+f[i-][j-i]-(j>=(n+)*?f[i-][j-(n+)*]:)+p)%p;

            }

        }

        printf("%d\n",f[k][(n+)*k]);

    }

    return ;

}

}

signed main(){

    Miracle::main();

    return ;

}

/*

   Author: *Miracle*

   Date: 2019/3/20 16:26:21

*/