#include <bits/stdc++.h>
#define rep(i, a, b) for (auto cc##i = (b), i = (a); i <= cc##i; ++i)
#define per(i, a, b) for (auto cc##i = (b), i = (a); i >= cc##i; --i)
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;

typedef long long LL;
const int N = 105;
const int P = 1e9 + 7;

inline int qp(int a, int b = P - 2) {
  int res = 1;
  while (b) {
    if (b & 1) res = LL(res) * a % P;
    a = LL(a) * a % P;
    b /= 2;
  }
  return res;
}

int n, m;
int a[N], f[2][N][N * N];

void solve() {
  cin >> n >> m;
  rep(i, 1, n) cin >> a[i];
  a[0] = a[n + 1] = 1;
  rep(i, 0, n) rep(j, 0, n * (n + 1) / 2) f[0][i][j] = f[1][i][j] = 0;
  f[0][0][0] = 1;
  for (int i = 0; i <= n; ++i) {
    int p = i & 1, q = p ^ 1;
    rep(j, 0, i + 1) rep(k, 0, (i + 1) * (i + 2) / 2)
      f[q][j][k] = 0;
    rep(j, 0, i) rep(k, 0, i * (i + 1) / 2) if (f[p][j][k]) {
      int len = i - j, w = len * (len + 1) / 2;
      if (a[i + 1] == 0) {
        (f[q][j][k] += f[p][j][k]) %= P;
      }
      if (a[i + 1] == 1) {
        (f[q][i + 1][k + w] += f[p][j][k]) %= P;
      }
      if (a[i + 1] == 2) {
        (f[q][j][k] += f[p][j][k]) %= P;
        (f[q][i + 1][k + w] += P - f[p][j][k]) %= P;
      }
    }
  }
  int ans = 0, p = (n + 1) & 1;
  rep(k, 0, n * (n + 1) / 2) if (f[p][n + 1][k]) {
    (ans += LL(f[p][n + 1][k]) * qp(k, m) % P) %= P;
  }
  cout << ans << "\n";
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}