def func():
q = int(input())
for _ in range(q):
linha = input().split()
n = int(linha[0])
moves = int(linha[1])
string = input()
deslocamentos = 0
ones = 0
zeros = 0
feito = False
ans = ""
for i in range(n):
if string[i] == "1":
ones += 1
else:
if deslocamentos + ones <= moves:
ans += "0"
deslocamentos += ones
zeros += 1
else:
ans += "1" * (deslocamentos + ones - moves)
ans += "0"
ans += "1" * (moves - deslocamentos)
ans += string[i+1:]
print(ans)
feito = True
break
if not feito:
ans += "1" * (ones)
print(ans)
func()
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |
221. Maximal Square | 1200. Minimum Absolute Difference |
1619B - Squares and Cubes | 1619A - Square String |
1629B - GCD Arrays | 1629A - Download More RAM |
1629C - Meximum Array | 1629D - Peculiar Movie Preferences |
1629E - Grid Xor | 1629F1 - Game on Sum (Easy Version) |
2148. Count Elements With Strictly Smaller and Greater Elements | 2149. Rearrange Array Elements by Sign |
2150. Find All Lonely Numbers in the Array | 2151. Maximum Good People Based on Statements |
2144. Minimum Cost of Buying Candies With Discount | Non empty subsets |