#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define mod 1'000'000'007

void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    if (n & 1)
    {
        cout << 0 << '\n';
        return;
    }
    vector<vector<int>> dp(n + 1, vector<int>(n + 1));
    for (int i = 1; i <= n; i++)
        dp[i][i - 1] = 1;
    auto check1 = [&](int x, int y) -> int
    {
        if (a[x] < 0 || a[y] > 0)
            return 0;
        if (a[x] && a[y] && a[x] + a[y])
            return 0;
        int res = 1;
        if (!a[x] && !a[y])
            res = m;
        return res;
    };
    for (int len = 2; len <= n; len += 2)
    {
        for (int i = 1; i + len - 1 <= n; i++)
        {
            dp[i][i + len - 1] = (i64)check1(i, i + len - 1) * dp[i + 1][i + len - 2] % mod;
            for (int k = i + 1; k < i + len - 1; k += 2)
            {
                int tmp = (i64)dp[k + 1][i + len - 1] * dp[i + 1][k - 1] % mod;
                tmp = (i64)tmp * check1(i, k) % mod;
                dp[i][i + len - 1] = (dp[i][i + len - 1] + tmp) % mod;
            }
        }
    }
    cout << dp[1][n] << '\n';
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}