#include<bits/stdc++.h>

#define endl '\n'
#define pii pair<int, int>
#define int long long

using namespace std;

const int mod=1e9+7;

void solve(){
	int n,m;
	cin>>n>>m;

	vector<int>a(n+1);
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}

	vector dp(n+10,vector<int>(n+10,-1));

	function<int(int,int)>dfs=[&](int L,int R){
		if ((R - L + 1) % 2)return 0ll;
    if (L > R)return 1ll;
    if (dp[L][R] != -1)return dp[L][R];
    int res = 0;
    if (a[L] == 0) {
        for (int i = L + 1; i <= R; i += 2) {
            if (a[i] == 0) {
                res += m * dfs(i + 1, R)%mod * dfs(L + 1, i - 1)%mod;
                res%=mod;
            }
            else if (a[i] < 0) {
                res+= dfs(i + 1, R) * dfs(L + 1, i - 1)%mod;
                res%=mod;             
            }
        }
    }
    else if (a[L] > 0) {
        for (int i = L + 1; i <= R; i += 2) {
            if (a[i] == 0) {
                res += dfs(i + 1, R) * dfs(L + 1, i - 1)%mod;
                res%=mod;
            }
            else if (a[i] == -a[L]) {
                res += dfs(i + 1, R) * dfs(L + 1, i - 1)%mod;
                res%=mod;
            }
        }
    }
    return dp[L][R] = res;
	};

	cout<<dfs(1,n)<<endl;
	// cout<<1<<endl;
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int t;
	cin>>t;

	while(t--){
		solve();
	}

	
	return 0;
}