#include<bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>*/
typedef long long ll;
#define N 5001
#define lcm(a,b) ((a*b)/__gcd(a,b))
const ll mod=1e9+7;
        ll prime[N];
        vector<int>all_primes;
        ll prime_factors[N];
        void seive()
        {
            memset(prime,0,sizeof(prime));
            prime[0]=1;prime[1]=1;
            for(ll i=2;i*i<=N-1;i++)
            {
            if(prime[i]==0)
                {
                    for(ll j=i*i;j<N;j+=i)
                    {
                        prime[j]=1;
                    }
                }
            }
            for(int i=1;i<N;i++)
            {
                if(!prime[i])
                {
                    all_primes.push_back(i);
                }
            }
        }

        void spf()
        {
            for(ll i=1;i<N;i++)
            {
                prime_factors[i]=i;
            }

            for(ll i=2;i*i<=N-1;i++)
            {
                for(ll j=i*i;j<=N-1;j+=i)
                {
                    if(prime_factors[j]==j)
                        prime_factors[j]=i;
                }
            }
        }
//code starts here
ll binary_expo(ll base,ll power)
{
    ll ans=1;
    while(power>0)
    {
        if(power%2==1)
            ans=(ans*base)%mod;

        base=(base*base)%mod;
        power/=2;
    }
    return ans;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll fact[N];
    fact[0]=1;
    for(ll i=1;i<N;i++)
    {
        fact[i]=(i*fact[i-1])%mod;
    }
    int t;
    cin>>t;
    //t=1;
    while(t--)
    {
       int n,k,one=0,zero=0;
       cin>>n>>k;
       int a[n];
       for(int i=0;i<n;i++)
       {
           cin>>a[i];
           if(a[i]==1)
            one++;
           else
            zero++;
       }
       if(k>one)
       {
           cout<<"0\n";
           continue;
       }
       int x=one-k;
       ll ans=0;

       ll y=fact[zero];
       ll u=fact[one];
       ll v=fact[one-x];
       ll p=(u*binary_expo(v,mod-2))%mod;
       ll q=(p*fact[zero])%mod;

       if(zero>0)
        ans=(ans+y)%mod;
       if(one>0 && zero>0)
        ans=(ans+q)%mod;
       if(one>0)
        ans=(ans+p)%mod;

       cout<<ans<<"\n";
    }
}