#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=510;
const ll mod=1e9+7;
int a[N];
ll dp[N][N];

ll get(int x,int y){
	if(x>y){
		return 1;
	}
	return dp[x][y];
}
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		int n,m;
		scanf("%d%d",&n,&m);
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
		}
		memset(dp,-1,sizeof dp);
		for(int i=1;i<n;i++){
			if(a[i]>0)
			{
				if((a[i]+a[i+1])==0)
				{
					dp[i][i+1]=1;
				}else if(!a[i+1])
				{
					dp[i][i+1]=1;
				}
			}else if(!a[i])
			{
				if(!a[i+1])
				{
					dp[i][i+1]=m;
				}else if(a[i+1]<0){
					dp[i][i+1]=1;
				}
			}
		}
		for(int len=4;len<=n;len+=2)
		{
			for(int i=1;i+len-1<=n;i++){
				int j=i+len-1;
				ll x=get(i+1,j-1);
				if(a[i]<0)	continue;
				if(x>=0){
					if(a[i]>0)
					{
						if((a[i]+a[j])==0)
						{
							if(dp[i][j]==-1)	dp[i][j]=0;
							dp[i][j]=(dp[i][j]+get(i+1,j-1))%mod;
						}else if(!a[i+1])
						{
							if(dp[i][j]==-1)	dp[i][j]=0;
							dp[i][j]=(dp[i][j]+get(i+1,j-1))%mod;
						}
					}else if(!a[i])
					{
						if(!a[j])
						{
							if(dp[i][j]==-1)	dp[i][j]=0;
							dp[i][j]=(dp[i][j]+get(i+1,j-1)*m%mod)%mod;
						}else if(a[j]<0){
							if(dp[i][j]==-1)	dp[i][j]=0;
							dp[i][j]=(dp[i][j]+get(i+1,j-1))%mod;
						}
					}					
				}
//				cout<<len<<" debug "<<i<<" "<<j<<" "<<dp[i][j]<<endl;								 
				for(int k=i+1;k<j;k+=2){
					//枚举中间的点
					ll x=get(i+1,k-1),y=get(k+1,j);
					if(x<0||y<0)
					{
						continue;
					}
					if(a[i]>0)
					{
						if((a[i]+a[k])==0)
						{
							if(dp[i][j]==-1)	dp[i][j]=0;
							dp[i][j]=(dp[i][j]+x*y%mod)%mod;
						}else if(!a[k])
						{
							if(dp[i][j]==-1)	dp[i][j]=0;
							dp[i][j]=(dp[i][j]+x*y%mod)%mod;
						}
					}else if(!a[i])
					{
						if(!a[k])
						{
							if(dp[i][j]==-1)	dp[i][j]=0;
							dp[i][j]=(dp[i][j]+x*m%mod*y%mod)%mod;
						}else if(a[j]<0){
							if(dp[i][j]==-1)	dp[i][j]=0;
							dp[i][j]=(dp[i][j]+x*y%mod)%mod;
						}
					}
				}
//				cout<<len<<" ceil  "<<i<<" "<<j<<" "<<dp[i][j]<<endl;	
			}
		}
		if(dp[1][n]==-1){
			dp[1][n]=0;
		}
		printf("%lld\n",dp[1][n]);
	}
	return 0;
}