#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<set>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pr;
const double pi=acos(-1);
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define Rep(i,u) for(int i=head[u];i;i=Next[i])
#define clr(a) memset(a,0,sizeof a)
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
ld eps=1e-9;
ll pp=1000000007;
ll mo(ll a,ll pp){if(a>=0 && a<pp)return a;a%=pp;if(a<0)a+=pp;return a;}
ll powmod(ll a,ll b,ll pp){ll ans=1;for(;b;b>>=1,a=mo(a*a,pp))if(b&1)ans=mo(ans*a,pp);return ans;}
ll read(){
    ll ans=0;
    char last=' ',ch=getchar();
    while(ch<'0' || ch>'9')last=ch,ch=getchar();
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    if(last=='-')ans=-ans;
    return ans;
}
//head
multiset<ll>Q;
ll dp[11][11][110],b[11];
int a[11],tot;
void add(int n,int w){
    ll t=0;
    per(i,n,1){
        t=t*11+a[i];
        if(w==1){
            if(Q.find(t)==Q.end())++tot;
            Q.insert(t);
        }
        else{
            Q.erase(Q.find(t));
            if(Q.find(t)==Q.end())--tot;
        }
    }
}
void dfs(int n,int m){
//    cout<<n<<" "<<m<<endl;
    if(n==11)return;
    a[n]=m+1;
    add(n,1);
    dp[n][m+1][tot]++;
    dfs(n+1,m+1);
    add(n,-1);
    rep(i,1,m){
        a[n]=i;
        add(n,1);
        dp[n][m][tot]++;
        dfs(n+1,m);
        add(n,-1);
    }
}
void pre(){
    dfs(1,0);
}
int main(){
    pre();
    int T=read();
    while(T--){
        ll ans=0;
        int n=read(),m=read(),K=read();
        b[0]=1;
        rep(i,1,n)b[i]=b[i-1]*(K+1-i)%pp;
        rep(i,1,n)
            if(dp[n][i][m])ans=(ans+b[i]*dp[n][i][m])%pp;
        printf("%d\n",(int)ans);
    }
    return 0;
}