#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

const int mod = 1e9 + 7, N = 5e3 + 3;
int dp[N][N];

void solve() {
    int n, k, cnt0 = 0;
    cin >> n >> k;
    vector<bool> v(n);
    for (int i = 0; i < n; i++) {
        bool x; cin >> x;
        v[i] = x;
        cnt0 += x;
    }
    if(cnt0 < k) {
        cout << 0 << endl;
        return;
    }

    for (int i = 0; i < n; i++) {
        for(int j = max(0, k - 1); j <= n; j++) dp[i][j] = -1;
    }
    
    auto rec = [&](int i, int cnt, auto&& self) -> int {
        if(i == n or cnt < k) return 0;
        auto &ans = dp[i][cnt];
        if(ans != -1) return ans;
        ans = self(i + 1, cnt, self); // not take
        if(v[i]) ans += (cnt - 1 >= k) + self(i + 1, cnt - 1, self);
        else ans += (cnt >= k) + self(i + 1, cnt, self);
        return ans %= mod;
    };

    cout << (rec(0, cnt0, rec) + mod) % mod << endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}