Cinema（排座位）

H. Cinema

time limit per test1.0 s                 memory limit per test  256 MB

input  standard input                    output  standard output

Rami and K of his friends are going to watch a movie tonight. There are only one row that contains some available seats, all other rows are taken. Given the description of this row, Rami wants to know if he can find consecutive seats available to sit with his friends.

Input

The first line of input contains a single integer T, the number of test cases.

The first line of each test case consists of two-separated integers C, K (1 ≤ C, K ≤ 105), the number of seats in the row and the number of friends going with Rami, respectively.

The second line contains a string of C digits, where 0 represents an empty seat, and 1 represents taken one.

Output

For each test case, print a single line with yes if Rami can find a place for him and his friends, otherwise print no.

Example   input

2
5 2
10101
6 3
000011

output

no
yes

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
    char a[100010];
    int t, c, k, i, b;
    scanf("%d", &t);
    while(t--)
    {
        b = 0;
        scanf("%d %d %s", &c, &k, a);
        for(i = 0; i < c; i++)
        {
            if(a[i] == '0')
            {
                b++;
                if(b > k)
                {
                    printf("yes\n");
                    break;
                }
            }
            else b = 0;
        }
        if(i == c) printf("no\n");
    }
    return 0;
}