#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cassert>

using namespace std;
typedef unsigned long long LL;
#define FOR(k,a,b) for(int k(a); k < (b); ++k)
#define REP(k,a) for(int k=0; k < (a); ++k)
#define ABS(a) ((a)>0?(a):-(a))

const int MOD = 1e9+7;

int popcount(int a)
{
	int res = 0;
	while(a)
	{
		++res;
		a&=(a-1);
	}
	return res;
}

int main(int argv, char** argc)
{
	int T,N,K,L;
	int A[20];
	scanf("%d",&T);
	assert(0<T && T<11);
	while(T--)
	{
		scanf("%d %d %d",&N,&K,&L);
		assert(0<N && N<17 && 0<K && K<17 && 0<L && L<=N);
		REP(i,N)
		{
			scanf("%d",A+i);
			assert(A[i]>0 && A[i]<=K);
		}
		vector<vector<int> > trans(K+1, vector<int> (1<<N));
		//calculate transitions
		FOR(i,1,K+1)
		REP(j,1<<N)
		{
			int p=0, u=0, res=0;
			REP(k,N)
			{
				if(p==u )
				{
					if(j&(1<<k))
					{
						res|=1<<k;
					}
					else if(A[k]==i)
					{
						res|=1<<k;
						u++;
					}
					
				}
				else if(u>p && j&(1<<k))
				{
					++p;
				}
			}
			trans[i][j]=res;
		}
		vector<LL> actual(1<<N),next(1<<N);
		actual[0]=1;
		REP(i,N)
		{
			fill(next.begin(),next.end(),0);
			REP(j,1<<N) if(popcount(j)<=L && popcount(j)+N-i>=L) for(int kk= 1;kk<=K;++kk)
			{
				next[trans[kk][j]]=(next[trans[kk][j]]+actual[j])%MOD;
			}
			next.swap(actual);
		}
		LL ans = 0;
		REP(i,1<<N) 
		{
			if(popcount(i)==L)
				ans=(ans+actual[i])%MOD;
		}
		printf("%d\n",ans);
	}
	return 0;
}