#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=100+5,M=N*20+5,K=600+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
int n,m,A[N];ll dp[N][N*N/2];
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
void Solve(){
	int i,j,h;scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++) scanf("%d",&A[i]);
	A[0]=A[n+1]=1;for(i=0;i<=n+1;i++) Me(dp[i],0);dp[0][0]=1;
	for(i=1;i<=n+1;i++) {
		if(!A[i]) continue;
		for(j=i-1;~j;j--) {
			for(h=0;h<=j*(j-1)/2;h++) if(dp[j][h]) dp[i][h+(i-j-1)*(i-j)/2]+=dp[j][h]*(A[i]^1?-1:1);
			if(A[j]==1) break;
		}
	}
	ll ans=0;for(i=0;i<=n*(n+1)/2;i++) ans+=dp[n+1][i]*mpow(i,m);
	printf("%lld\n",(ans%mod+mod)%mod);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}