#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define endl "\n"
int t, cs = 0;
const int mxn = 2e5 + 3, mod = 1e9 + 7;
int fact[mxn];
int power(int base, int po)
{
    int res = 1;
    while(po)
    {
        if(po & 1)res = 1LL * base * res % mod;
        base = 1LL * base * base % mod, po /= 2;
    }
    return res;
}
void pre()
{
    fact[0] = 1;
    for(int i = 1; i < mxn; i++)fact[i] = 1LL * fact[i - 1] * i % mod;
}
int ncr(int n, int r)
{
    if(r > n)return 0;
    int ans = fact[n];
    ans = 1LL * ans * power(fact[n - r], mod - 2) % mod;
    ans = 1LL * ans * power(fact[r], mod - 2) % mod;
    return ans;
}
int32_t main()
{
    //fast
    pre();
    w(t)
    {
        int n, k;
        cin >> n >> k;
        int ar[n + 1];
        int sum = 0;
        for(int i = 1; i <= n; i++)cin >> ar[i], sum += ar[i];
        if(k > sum)kill(0);

        int ans = power(2, n - sum);
        ans--;
        if(!k)kill(ans);
        int rans = 0;
        for(int i = k; i < sum; i++)rans += ncr(sum, i), rans %= mod;
        int ex = 1LL * ans * rans % mod;
        ans = (ans % mod + ex % mod + rans % mod) % mod;
        cout << ans << endl;

    }
}