{"raw_statement":[{"iden":"statement","content":"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.\n\nThe first line of input contains a single integer T, the number of test cases.\n\nThe 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.\n\nThe second line contains a string of C digits, where 0 represents an empty seat, and 1 represents taken one.\n\nFor each test case, print a single line with *yes* if Rami can find a place for him and his friends, otherwise print *no*.\n\n"},{"iden":"input","content":"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."},{"iden":"output","content":"For each test case, print a single line with *yes* if Rami can find a place for him and his friends, otherwise print *no*."}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ T \\in \\mathbb{Z} $ be the number of test cases.  \nFor each test case $ k \\in \\{1, \\dots, T\\} $:  \n- Let $ C_k \\in \\mathbb{Z} $ be the number of seats in the row.  \n- Let $ K_k \\in \\mathbb{Z} $ be the number of friends (so Rami and his friends require $ K_k + 1 $ consecutive seats).  \n- Let $ S_k \\in \\{0,1\\}^{C_k} $ be a binary string representing seat availability: $ S_k[i] = 0 $ means empty, $ S_k[i] = 1 $ means taken.\n\n**Constraints**  \n1. $ 1 \\le T \\le 10^5 $  \n2. For each $ k \\in \\{1, \\dots, T\\} $:  \n   - $ 1 \\le C_k \\le 10^5 $  \n   - $ 1 \\le K_k \\le 10^5 $  \n   - $ S_k $ has length $ C_k $, with each character in $ \\{0,1\\} $\n\n**Objective**  \nFor each test case $ k $, determine if there exists a contiguous substring of $ S_k $ of length $ L_k = K_k + 1 $ such that all characters in the substring are $ 0 $.  \nOutput \"yes\" if such a substring exists, otherwise \"no\".","simple_statement":"Rami and K friends want to sit together in a row of C seats.  \n0 = empty seat, 1 = taken seat.  \nCan they find K+1 consecutive empty seats?  \nPrint \"yes\" if yes, \"no\" if no.","has_page_source":false}