#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 110LL;
const int mod = 1e9 + 7;
int n,m;
int a[maxn];
int lim[maxn];
ll dp[maxn][5060][2];
ll ppow(ll x, ll y)
{
    ll temp=1LL;
    while (y)
    {
        if (y&1) temp=temp*x%mod;
        x=x*x%mod;
        y/=2;
    }
    return temp;
}

void xuly()
{
    cin>>n>>m;
    for (int i=1; i<=n; i++) cin>>a[i];
    a[0]=a[n+1]=1;
    dp[0][0][0] = 0LL;
    dp[0][0][1] = 1LL;
    int mmax = 0;
    lim[0] = 0;
    for (int i=1,last=0; i<=n+1; i++)
    {
        lim[i] = lim[last]+(i-last)*(i-last-1)/2;
        for (int j=0; j<=lim[i]; j++) dp[i][j][0] = dp[i][j][1] = 0LL;
        for (int j=last; j<i; j++)
        {
            if (a[j]==0) continue;
            int val = (i-j)*(i-j-1)/2;
            for (int k=0; k<=lim[j]; k++)
                for (int type=0; type<2; type++)
                    if (dp[j][k][type])
                        dp[i][k+val][type^1] = (dp[i][k+val][type^1] + dp[j][k][type])%mod;
        }
        if (a[i]==1) last=i;
    }
    ll ans = 0;
    int sum = 0;
    for (int i=0; i<=n+1; i++) if (a[i]==1) sum++;
    for (int j=0; j<=lim[n+1]; j++)
    {
        ans = (ans + (dp[n+1][j][0] - dp[n+1][j][1] + mod)%mod*ppow(j,m)%mod)%mod;
    }
    if (sum%2==1) ans = (mod-ans)%mod;
    ans=(ans+mod)%mod;
    cout<<ans<<'\n';
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    int tt; cin>>tt;
    while (tt--) xuly();
}