#include<cstdio>
#include<algorithm>
#include<vector>
#define pb push_back
#define f(i,a,b) for(int i=(a),i##end=(b);i<=i##end;i=-(~i))
#define rf(i,a,b) for(int i=(a),i##end=(b);i>=i##end;i=~(-i))
using namespace std;
using ll=long long;
const int neko=110,mod=1e9+7;
int ADD(int x,int y){return x+y>=mod?x+y-mod:x+y;}
int n,m,a[neko];
int dp[neko][neko*neko][2];//dp[i][j][k]表示考虑前i个，有j个合法区间，前面有偶数/奇数个1
int lim[neko];
int spow(int m,int n)
{
    int b=1;
    for(;n;n>>=1,m=1ll*m*m%mod)if(n&1)b=1ll*b*m%mod;
    return b;
}
int main()
{
    int cas;
    scanf("%d",&cas);
    while(cas--)
    {
        scanf("%d%d",&n,&m);
        int flag=0;
        f(i,1,n)
        {scanf("%d",&a[i]);if(a[i]==1)flag^=1;}
        a[0]=a[n+1]=1;
        dp[0][0][0]=0,dp[0][0][1]=1,lim[0]=0;
        int las=0;
        f(i,1,n+1)if(a[i]>0)
        {
            lim[i]=lim[las]+(i-las)*(i-las-1)/2;
            f(j,0,lim[i])dp[i][j][0]=dp[i][j][1]=0;
            f(l,las,i-1)if(a[l]>0)
            {
                int delta=(i-l)*(i-l-1)/2;
                f(j,0,lim[l])
                    f(k,0,1)
                        dp[i][j+delta][k]=ADD(dp[i][j+delta][k],dp[l][j][k^1]);
            }
            if(a[i]==1)las=i;
        }
                    
        int ans=0;
        f(j,0,lim[n+1])ans=ADD(ans,1ll*ADD(dp[n+1][j][0],mod-dp[n+1][j][1])*spow(j,m)%mod);
        if(flag==1)ans=ADD(mod,mod-ans);
        printf("%d\n",ans);
    }
    return 0;
}