Migrated from Lutece 587 consecutive

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

You are given a 01 sequence whose size is $n$. you can change at most $k$ 0 into 1 in the sequence. Now I want to know how many consecutive 1 in the sequce at most after you do the change.

Input

The first of input is an integer $t$ which stands for the number of test cases.

for each test case, the first line contains two number $n$, $k$ ( $1 \leq n \leq 100000$, $0 \leq k \leq n$ ).

the next contains $n$ element of the sequence, whose value is 0 or 1.

Output

Output the answer in one line for each test case.

Samples

2
4 2
1 0 0 1
4 1
1 0 1 0

4
3

Resources

Sichuan University Programming Contest