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

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdi = pair<double, int>;
using pdd = pair<double, double>;
using ull = unsigned long long;
using LL = __int128_t;

#define ppc(x) __builtin_popcount(x)
#define clz(x) __builtin_clz(x)

bool Mbe;

constexpr int mod = 1e9 + 7;
void addt(int &x, int y) {
  x += y, x >= mod && (x -= mod);
}
int add(int x, int y) {
  return x += y, x >= mod && (x -= mod), x;
}
int ksm(int a, ll b) {
  int s = 1;
  while(b) {
    if(b & 1) s = 1ll * s * a % mod;
    a = 1ll * a * a % mod, b >>= 1;
  }
  return s;
}

// ---------- templates above ----------

constexpr int N = 100 + 5;
constexpr int M = N * N / 2;

int n, m, a[N], f[N][M];
int S2(int x) {return x * (x + 1) / 2;}
void solve(int T) {
  cin >> n >> m;
  for(int i = 1; i <= n; i++) cin >> a[i];
  memset(f, 0, sizeof(f));
  f[0][0] = -1, a[0] = a[n + 1] = 2;
  for(int i = 1; i <= n + 1; i++) {
    if(!a[i]) continue;
    for(int j = i - 1; ~j; j--) {
      if(!a[j]) continue;
      int lim = S2(j);
      for(int p = 0; p <= lim; p++) {
        int c = f[j][p];
        if(a[i] == 2) c = mod - c;
        addt(f[i][p + S2(i - j - 1)], c);
      }
      if(a[j] == 1) break;
    }
  }
  int ans = 0;
  for(int i = 0; i <= S2(n); i++) {
    addt(ans, 1ll * f[n + 1][i] * ksm(i, m) % mod);
  }
  cout << ans << "\n";
}

bool Med;
signed main() {
  fprintf(stderr, "%.3lf MB\n", (&Mbe - &Med) / 1048576.0);
  // ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  #ifdef ALEX_WEI
    FILE* IN = freopen("1.in", "r", stdin);
    FILE* OUT = freopen("1.out", "w", stdout);
  #endif
  int T = 1;
  cin >> T;
  while(T--) solve(T);
  fprintf(stderr, "%.3lf ms\n", 1e3 * clock() / CLOCKS_PER_SEC);
  return 0;
}

/*
g++ a.cpp -o a -std=c++14 -O2 -DALEX_WEI
*/