INS14C  Digo plays with Numbers
Digo and his friend Sharry have completed their missions and were relaxing. Both of them love mathematics and love to play with numbers. They have a book in which several binary strings are written. Digo comes up with an idea of an interesting game. He asks Sharry to think of a number K, which is less than or equal to the length of the string N. Both players play alternately. In his turn, a person can remove any bit from the binary string. Digo removes such as to maximize the value of the leftover binary string while Sharry plays to minimze the string. This process continues till K binary digits are left. You have to tell those K binary digits left after the game is over.
It is given that Sharry always plays first.
Input Format:
The first line consists of a single integer T, denoting the number of test cases.
2*T lines follow. For every test case, the first line consists of two integers N and K, denoting the initial length of the string and its length at the end of the game. The second line for the test case contains the initial binary string of length N.
Output Format:
For each test case print the final string left after removal of characters.
Constraints:
1 <= T <= 1000
1 <= N <= 1000
1 <= K <= N
Sample Input:
2
5 3
10010
4 2
1111
Sample Output:
010
11
hide comments
Beginner :P:
20140415 06:13:36
Sample Input:


NISHANT RAJ:
20140401 15:36:16
Easy one... 

knb_dtu:
20140324 14:49:01
What if there's no digit which can maximize the value of binary number?


MENDAX:
20140326 22:30:39
is test case ??


Jacob Plachta:
20140320 21:36:08
N can be equal to K  the problem isn't clear about this.

Added by:  Surya Kiran 
Date:  20140320 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Insomnia 2014 