#include <iostream>
#include <cstdio>
#include<list>
#include<iomanip>
#include<cmath>
#include<queue>
#include <functional>
#include<stdio.h>
#include<assert.h>
#include<stack>
#include<sstream>
#include <cstdlib>
#include<map>
#include<algorithm>
#include<set>
#include<utility>
#include<memory.h>
#include<string>
#include<vector>
#include<numeric>
#include <bitset>
using namespace std;
#define ll  long long
#define pb push_back
#define fi(ss) freopen (ss,"r",stdin)
#define fo(ss) freopen (ss,"w",stdout)
#define sz(v)               ((ll)((v).size()))
#define all(x)          (x).begin(),(x).end()
#define rep(i, v)       for(ll i=0;i<sz(v);i++)
#define lp(i,n) for(ll i = 0 ; i < n ; ++i)
#define lpab(i, a, b) for(ll i = a; i <= b; i++)
#define lpba(i, b, a) for(ll i = b; i >= a; i--)
#define hash ___hash
#define next ___next
#define prev ___prev
#define left ___left
#define time __time
typedef pair<ll, ll> pii;
#define F first
#define S second
#define MP make_pair
#define vi vector<ll>
#define vvi vector<vi>
#define vpii vector<pii>
#define mpii map<ll, ll> 
#define mpsi map<string, ll>
#define vs vector<string>
#define ld long double
#define vd vector<ld>
#define pie acos(-1)
const ll maxn = 4 * 100005;
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define txtio   freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define OO 1e18

ll mod = 1e9 + 7;

ll power(ll a, ll p, ll m)
{
	if (p == 0)
		return 1;
	ll sq = power(a, p / 2, m);
	sq %= m;
	sq *= sq;
	sq %= m;
	if (p % 2)
		sq *= a;
	sq %= m;
	return sq;
}

ll modInverse(int A, int M)
{
	return power(A, M - 2, M) % mod;
}

vi factorial(1e6 + 1);

ll fact(ll n)
{
	return factorial[n];
}

ll comb(ll n, ll k)
{
	if (n == k)
		return 1;
	ll n1 = fact(n), n2 = modInverse(fact(k), mod), n3 = modInverse(fact(n - k), mod);
	ll res = n1 * n2;
	res %= mod;
	res *= n3;
	return res % mod;
}

int main()
{
	fastio;
	ll t;
	ll num = 1;
	lpab(i, 1, 1e6)
	{
		num *= i;
		num %= mod;
		factorial[i] = num;
	}
	cin >> t;
	while (t--)
	{
		ll n, k, sum = 0;
		cin >> n >> k;
		ll n0 = 0, n1 = 0;
		vi v(n);
		lp(i, n)
		{
			cin >> v[i];
			sum += v[i];
			if (v[i] == 0)
				n0++;
		}
		if (sum <= k)
		{
			cout << 0 << endl;
			continue;
		}
		n1 = sum - k;
		ll ans = 0;
		ll b = 0;
		lpab(i, 1, n1)
		{
			b += comb(sum, i);
			b %= mod;
		}
		b %= mod;
		ll a = 0;
		lpab(i, 1, n0)
		{
			if (n0 == 1)
			{
				a = 1;
				break;
			}
			a += comb(n0, i);
			a %= mod;
		}
		ans += a;
		ans += b;
		ans %= mod;
		ans += a * b;
		ans %= mod;
		ans %= mod;
		cout << ans << endl;
	}
	return 0;
}