<image>

William really likes the cellular automaton called "Game of Life" so he decided to make his own version. For simplicity, William decided to define his cellular automaton on an array containing n cells, with each cell either being alive or dead.

Evolution of the array in William's cellular automaton occurs iteratively in the following way:

  * If the element is dead and it has exactly 1 alive neighbor in the current state of the array, then on the next iteration it will become alive. For an element at index i the neighbors would be elements with indices i - 1 and i + 1. If there is no element at that index, it is considered to be a dead neighbor. 
  * William is a humane person so all alive elements stay alive. 



Check the note section for examples of the evolution.

You are given some initial state of all elements and you need to help William find the state of the array after m iterations of evolution.

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 10^3). Description of the test cases follows.

The first line of each test case contains two integers n and m (2 ≤ n ≤ 10^3, 1 ≤ m ≤ 10^9), which are the total number of cells in the array and the number of iterations.

The second line of each test case contains a string of length n made up of characters "0" and "1" and defines the initial state of the array. "1" means a cell is alive and "0" means it is dead.

It is guaranteed that the sum of n over all test cases does not exceed 10^4.

Output

In each test case output a string of length n, made up of characters "0" and "1" — the state of the array after m iterations of evolution.

Example

Input


4
11 3
01000000001
10 2
0110100101
5 2
10101
3 100
000


Output


11111001111
1110111101
10101
000

Note

Sequence of iterations of evolution for the first test case 

  * 01000000001 — initial state 
  * 11100000011 — first iteration of evolution 
  * 11110000111 — second iteration of evolution 
  * 11111001111 — third iteration of evolution 



Sequence of iterations of evolution for the second test case 

  * 0110100101 — initial state 
  * 1110111101 — first iteration of evolution 
  * 1110111101 — second iteration of evolution 
# ROG Zephyrus G15 GA503QE-HQ093T
# ROG Zephyrus G15 GA503QC-HQ078T


# ROG Zephyrus G14 GA401QC-K2120R
# ROG Zephyrus G14 GA401QC-K2118R
# ROG Zephyrus G14 GA401QE-K2197R

# ROG Zephyrus G15 GA502IV-AZ037T


# ROG Zephyrus G14 GA401QH-0031E5800HS

# ROG Zephyrus G15 GA503QM-HQ121R
# ROG Zephyrus G15 GA503QS-HQ076R

# ROG Zephyrus G14 GA401QM-0151E5900HS

# ROG Zephyrus G14 GA401QM-0162E5900HS
# ROG Zephyrus G15 GA503QR-HQ098R

# ROG Zephyrus G14 GA401II-HE177R
# ROG Zephyrus G14 GA401IU-HA182R
# ROG Zephyrus G14 GA401IV-HA258R

# ROG Zephyrus G15 GA502IU-AZ097T



# ROG Zephyrus G15 GA502DU-AZ095T































# Asus ROG Zephyrus G14 GA401II-HE231TS (VSNR03J5-BU3000) Ryzen 7 Windows 10 Home Gaming Laptop (16GB RAM, 1TB SSD, NVIDIA GeForce GTX 1650 Ti + 4GB Graphics, MS Office, 35.56cm, Moonlight White AniMe Matrix Version)
# 107990



# Asus ROG Zephyrus G15 (GA503QM-HQ148TS) Ryzen 7 Windows 10 Home Gaming Laptop (16GB RAM, 1TB SSD, NVIDIA GeForce RTX 3060 + 6GB Graphics, MS Office, 39.62cm, Eclipse Grey)
# 137990

# Asus ROG Zephyrus G14 2021 (GA401QH-BM070TS) Ryzen 7 Windows 10 Home Gaming Laptop (8GB RAM, 512GB SSD, NVIDIA GeForce GTX 1650 + 4GB Graphics, MS Office, 35.56cm, Moonlight White)
# 94990











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

    prev=s
    
    for __ in range(m):
        
        curr=''
        for i in range(n):
            if i==0:
                if s[i]=='0' and s[i+1]=='1':
                    curr+='1'
                else:
                    curr+=s[i]
            elif i ==n-1:
                if s[i]=='0' and s[i-1]=='1':
                    curr+='1'
                else:
                    curr+=s[i]
            else:
                if s[i]=='0' and int(s[i-1])+int(s[i+1])==1:
                    curr+='1'
                else:
                    curr+=s[i]
        if curr==s:
            break
        s=curr

    print(curr)