#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int N=510;
int a[N];
ll g[N][N],f[N][N];
int n,m;
ll sol(int i,int j){
	if(a[i]>0)
	{
		if((a[i]+a[j])==0)
		{
			return 1;
		}else if(!a[j])
		{
			return 1;
		}
	}else if(!a[i])
	{
		if(!a[j])
		{
			return m;
		}else if(a[j]<0){
			return 1;
		}
	}	
	return 0;
}//处理一下 
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&m);
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
		}
		memset(g,0,sizeof g);
		memset(f,0,sizeof f);
		for(int i=1;i<n;i++)
		{
			g[i][i+1]=f[i][i+1]=sol(i,i+1);
		}
		for(int len=4;len<=n;len+=2)
		{
			for(int i=1;i+len-1<=n;i++){
				int j=i+len-1;
				f[i][j]=g[i+1][j-1]*sol(i,j)%mod;
				g[i][j]=f[i][j];//初始化 
				for(int k=i+1;k<j;k+=2)
				{
					g[i][j]=(g[i][j]+g[i][k]*f[k+1][j]%mod)%mod;
				}
			}
		}
		printf("%lld\n",g[1][n]);
	}
	return 0;
}