Polycarp and his friends want to visit a new restaurant. The restaurant has $n$ tables arranged along a straight line. People are already sitting at some tables. The tables are numbered from $1$ to $n$ in the order from left to right. The state of the restaurant is described by a string of length $n$ which contains characters "1" (the table is occupied) and "0" (the table is empty).

Restaurant rules prohibit people to sit at a distance of $k$ or less from each other. That is, if a person sits at the table number $i$, then all tables with numbers from $i-k$ to $i+k$ (except for the $i$-th) should be free. In other words, the absolute difference of the numbers of any two occupied tables must be strictly greater than $k$.

For example, if $n=8$ and $k=2$, then:  strings "10010001", "10000010", "00000000", "00100000" satisfy the rules of the restaurant;  strings "10100100", "10011001", "11111111" do not satisfy to the rules of the restaurant, since each of them has a pair of "1" with a distance less than or equal to $k=2$. 

In particular, if the state of the restaurant is described by a string without "1" or a string with one "1", then the requirement of the restaurant is satisfied.

You are given a binary string $s$ that describes the current state of the restaurant. It is guaranteed that the rules of the restaurant are satisfied for the string $s$.

Find the maximum number of free tables that you can occupy so as not to violate the rules of the restaurant. Formally, what is the maximum number of "0" that can be replaced by "1" such that the requirement will still be satisfied?

For example, if $n=6$, $k=1$, $s=$ "100010", then the answer to the problem will be $1$, since only the table at position $3$ can be occupied such that the rules are still satisfied.


-----Input-----

The first line contains a single integer $t$ ($1 \le t \le 10^4$) — the number of test cases in the test. Then $t$ test cases follow.

Each test case starts with a line containing two integers $n$ and $k$ ($1 \le k \le n \le 2\cdot 10^5$) — the number of tables in the restaurant and the minimum allowed distance between two people.

The second line of each test case contains a binary string $s$ of length $n$ consisting of "0" and "1" — a description of the free and occupied tables in the restaurant. The given string satisfy to the rules of the restaurant — the difference between indices of any two "1" is more than $k$.

The sum of $n$ for all test cases in one test does not exceed $2\cdot 10^5$.


-----Output-----

For each test case output one integer — the number of tables that you can occupy so as not to violate the rules of the restaurant. If additional tables cannot be taken, then, obviously, you need to output $0$.


-----Example-----
Input
6
6 1
100010
6 2
000000
5 1
10101
3 1
001
2 2
00
1 1
0

Output
1
2
0
1
1
1



-----Note-----

The first test case is explained in the statement.

In the second test case, the answer is $2$, since you can choose the first and the sixth table.

In the third test case, you cannot take any free table without violating the rules of the restaurant.

Difficulty: introductory

Starter code:

Solutions:
import sys
INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
from math import gcd
from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br

def solve():
  n, k = I()
  s = input()
  ans = 0
  last = -INF
  for i in range(n):
    if s[i] == '1':
      if i - last <= k:
        ans -= 1
      last = i
      count = 0
      continue
    if i - last > k:
      ans += 1
      last = i 

  print(ans)

t, = I()
while t:
  t -= 1
  solve()

T = int(input())
for t in range(T):
    n, k = list(map(int, input().split()))
    tables = input()

    next_ones = [-1 for i in range(n)]
    last_one = -1
    for i in range(n - 1, -1, -1):
        # print(i)
        if tables[i] == "1":
            next_ones[i] = i
            last_one = i
        else:
            next_ones[i] = last_one

    prev_one = -1
    res = 0
    for i in range(n):
        if tables[i] == "1":
            prev_one = i
        else:
            if prev_one == -1 or i - prev_one > k:
                if next_ones[i] == -1 or next_ones[i] - i > k:
                    res += 1
                    prev_one = i

    print(res)


for _ in range(int(input())):
    n, k = list(map(int, input().split()))
    s = list(map(int,list(input())))
    ans = 0
    last1 = n*2
    for i in range(n):
        if s[i] == 1:
            last1 = i
        elif abs(last1 - i) <= k:
            s[i] = 1
    last1 = n*2
    for i in range(n-1,-1,-1):
        if s[i] == 1:
            last1 = i
        elif abs(last1 - i) <= k:
            s[i] = 1
    i = 0
    while i < n:
        if s[i] == 0:
            ans += 1
            i += k+1
        else:
            i += 1
    print(ans)


from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

def ri():
    return int(input())

def rl():
    return list(map(int, input().split()))


def solve():
    n, k = rl()
    s = input()
    blocks = [len(b) for b in s.split('1')]
    if len(blocks) == 1:
        print((blocks[0] + k) // (k + 1))
        return
    else:
        total = blocks[0] // (k + 1) + blocks[-1] // (k + 1)
        for b in blocks[1:-1]:
            total += max(0, (b - k) // (k + 1))

    print (total)
    # print (blocks)





mode = 'T'

if mode == 'T':
    t = ri()
    for i in range(t):
        solve()
else:
    solve()


def solve(n, k, s):
    nextone = [-1]*n
    last = float('inf')
    for i in range(n-1, -1, -1):
        if s[i] == '1':
            last = i
        nextone[i] = last
    prev = float('-inf')
    sol = 0
    for i in range(n):
        if s[i] == '1':
            prev = i
        else:
            if i-prev > k and nextone[i]-i > k:
                sol += 1
                prev = i
    return sol

t = int(input())
for _ in range(t):
    n, k = map(int, input().split())
    s = input()
    print(solve(n, k, s))


tt = int(input())

for loop in range(tt):

    n,k = map(int,input().split())
    s = input()

    lis = [0] * n
    tmp = [0] * n
    now = 0

    for i in range(n):

        if s[i] == "1":
            now += 1

            if i+k < n:
                tmp[i+k] += 1

        lis[i] += now

        now -= tmp[i]

    tmp = [0] * n
    now = 0

    for i in range(n-1,-1,-1):

        if s[i] == "1":
            now += 1

            if i-k >= 0:
                tmp[i-k] += 1

        lis[i] += now
        now -= tmp[i]

    tmp = -1
    ans = 0
    for i in range(n):

        if tmp < 0 and lis[i] == 0:
            ans += 1
            tmp = k

        tmp -= 1

    print (ans)

import math
for nt in range(int(input())):
	n,k = map(int,input().split())
	s = input()
	ind = []
	for i in range(n):
		if s[i]=="1":
			ind.append(i)
	if len(ind)==0:
		print (math.ceil(n/(k+1)))
		continue
	count = ind[0]//(k+1)
	for i in range(1,len(ind)):
		count += max(0,math.ceil((ind[i]-ind[i-1]-2*k-1)/(k+1)))
	count += (n-ind[-1]-1)//(k+1)
	print (count)

import sys
input = sys.stdin.readline

t=int(input())
for tests in range(t):
    n,k=list(map(int,input().split()))
    S=input().strip()
    
    A=[]

    X=0
    for s in S:
        if s=="0":
            X+=1
        else:
            A.append(X)
            X=0
    if X!=0:
        A.append(X)

    if len(A)==1 and A[0]==n:
        print(1+(n-1)//(k+1))
        continue

    ANS=0
    if S[0]=="0" and S[-1]=="0":
        ANS+=A[0]//(k+1)+A[-1]//(k+1)

        for i in range(1,len(A)-1):
            ANS+=(A[i]-k)//(k+1)

    elif S[0]=="0":
        ANS+=A[0]//(k+1)

        for i in range(1,len(A)):
            ANS+=max(0,A[i]-k)//(k+1)

    elif S[-1]=="0":
        ANS+=A[-1]//(k+1)

        for i in range(len(A)-1):
            ANS+=max(0,A[i]-k)//(k+1)

    else:
        for i in range(len(A)):
            ANS+=max(0,A[i]-k)//(k+1)

    print(ANS)
        
        
        
        
    

    


#A,B,C,D = map(int,input().split())
t = int(input())
for i in range(t):
    a,b = list(map(int,input().split()))
    D = list(input())
    
    sep = []
    c = b
    
    for j in range(a):
        if D[j] == '1':
            sep.append(max(0, c-b))
            c = 0
        else:
            c+=1
            
    sep.append(max(0, c))
    #print(sep)
     
    tot = 0
    for j in sep:
        tot += j//(b+1)
        
    print(tot)

t = int(input())

for _ in range(t):
    n, k = list(map(int, input().split()))
    s = input()
    prev = 0
    c = 0
    if s[0] == "0":
        c += 1
    for i, x in enumerate(s):
        if i == 0:
            continue
        if x == "1":
            if i - prev <= k:
                c -= 1
            prev = i
        else:
            if i - prev > k:
                c += 1
                prev = i
    print(c)


for t in range(int(input())):
    n,k = map(int,input().split())
    s = list(input())

    mk = 0
    for i in range(n):
        if s[i]=='1':
            for j in range(max(mk,i-k),min(i+k+1,n)):
                s[j] = 'X'
            mk = j

    ans = 0
    newBoundary = -1
    for i in range(n):
        if i > newBoundary and s[i]=='0':
            ans += 1
            newBoundary = i+k
    print(ans)

from sys import stdin, stdout, setrecursionlimit
for _ in range(int(input())):
    n, k = list(map(int, input().split()))
    s = input()
    s = '1' + '0' * k + s + '0' * k + '1'
    cou = 0
    a = []
    for i in range(len(s)):
        if s[i] == '1':
            a.append(i)
    # print(a)
    for i in range(1, len(a)):
        cou += (a[i] - a[i - 1] - 1 - k) // (k + 1)
    print(cou)