#include<bits/stdc++.h>
#define ll long long
#define sqr(x) ((x)*(x))
#define N 1000
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int mo=1000000007;
inline int read(){
	int x=0,w=0;char ch=getchar();
	while (!isdigit(ch))w|=ch=='-',ch=getchar();
	while (isdigit(ch))x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
	return w?-x:x;
}
ll f[N][N][2];
int a[N];
void solve(){
	int n=read(),m=read();
//	memset(f,0,sizeof(f));
	for (int i=1;i<=n;++i)a[i]=read(),f[i+1][i][0]=f[i+1][i][1]=1;
	for (int len=2;len<=n;len+=2){
		for (int i=1;i+len-1<=n;++i){
			int j=i+len-1;//cout<<i<<" "<<j<<"!!"<<endl;
			for (int k=0;k<2;++k)
				if (a[i]==-a[j]&&a[i]>=0){
					if (a[i])f[i][j][k]=f[i+1][j-1][1];
					else f[i][j][k]=1ll*f[i+1][j-1][1]*m%mo;
				}else{
					if (a[i]&&a[j]||a[i]<0||a[j]>0)f[i][j][k]=0;
					else f[i][j][k]=f[i+1][j-1][1];
				}
			for (int k=i+1;k<j-1;k+=2)
				f[i][j][1]=(f[i][j][1]+1ll*f[i][k][0]*f[k+1][j][1])%mo;
		}
	}
	cout<<f[1][n][1]<<endl;
}
signed main(){
	int T=read();
	while (T--)solve();
    return 0;
}