Untitled

#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
#define int long long
const int N = 1e6 + 10;
const int inf = 1e15;
const int mod = 998244353;

inline void solve(){
    
    int n, k;
    cin >> n >> k;

    vector<int> v;

    for(int i = 0;i < n;i += 1){
        int x;cin >> x;
        if(x == 1){
            v.push_back(i);
        }
    }

    if(v.empty()){
        cout << "No";
        return;
    }

    bool ok = 1;

    ok &= (v.front() <= k);
    ok &= (n - 1 - v.back() <= k);

    for(int i = 0;i < v.size() - 1;i += 1){
        ok &= (v[i + 1] - v[i] > k);
        ok &= (v[i + 1] - v[i] <= 2 * k + 1);
    }

    cout << (ok ? "Yes" : "No");

}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while(t--){
        solve();
        cout << '\n';
    }
    return 0;
}