#include <bits/stdc++.h>
using namespace std;

const int MOD = 1e9 + 7;

int add(int a, int b) {
    return a + b >= MOD ? a + b - MOD : a + b;
}

int sub(int a, int b) {
    return a >= b ? a - b : a + MOD - b;
}

int mul(int a, int b) {
    return (1ll * a * b) % MOD;
}

int pw(int x, int n) {
    int res = 1;
    while (n) {
        if (n % 2 == 0) {
            x = mul(x, x);
            n /= 2;
        } else {
            res = mul(res, x);
            --n;
        }
    }
    return res;
}

int C2(int l) {
    return l * (l - 1) / 2;
}

vector<int> operator*(const vector<int>& a, const vector<int>& b) {
    vector<int> c(a.size() + b.size() - 1);
    for (int i = 0; i < (int)a.size(); ++i) {
        for (int j = 0; j < (int)b.size(); ++j) {
            c[i + j] = add(c[i + j], mul(a[i], b[j]));
        }
    }
    return c;
}

vector<int> shift(const vector<int>& a, int d) {
    vector<int> res(a.size() + d);
    for (int i = 0; i < (int)a.size(); ++i) {
        res[i + d] = a[i];
    }
    return res;
}

vector<int> get(vector<int> p) {
    vector<vector<int>> dp(p.size());
    dp[0] = {sub(0, 1)};
    for (int i = 1; i < (int)p.size(); ++i) {
        dp[i].resize(C2(p[i]) + 1);
        for (int j = 0; j < i; ++j) {
            int shift = C2(p[i] - p[j]);
            for (int k = 0; k < (int)dp[j].size(); ++k) {
                dp[i][k + shift] = sub(dp[i][k + shift], dp[j][k]);
            }
        }
    }
    return dp[p.size() - 1];
}

void solve_() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> arr;
    arr.push_back({0});
    int cnt = 1;
    for (int i = 0; i < n; ++i) {
        int c;
        cin >> c;
        if (c == 0) {
            ++cnt;
        } else if (c == 2) {
            arr.back().push_back(cnt);
            ++cnt;
        } else {
            arr.back().push_back(cnt);
            arr.push_back({0});
            cnt = 1;
        }
    }
    arr.back().push_back(cnt);
    vector<int> ans = {1};
    for (auto elem : arr) {
        ans = ans * get(elem);
    }
    int sum = 0;
    for (int i = 0; i < (int)ans.size(); ++i) {
        sum = add(sum, mul(ans[i], pw(i, m)));
    }
    cout << sum << "\n";
}

#define MULTITEST

main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tst = 1;
#ifdef MULTITEST
    cin >> tst;
#endif // MULTITEST
    while (tst--) {
        solve_();
    }
    return 0;
}