Let's call two strings a and b (both of length k) a bit similar if they have the same character in some position, i. e. there exists at least one i ∈ [1, k] such that a_i = b_i.

You are given a binary string s of length n (a string of n characters 0 and/or 1) and an integer k. Let's denote the string s[i..j] as the substring of s starting from the i-th character and ending with the j-th character (that is, s[i..j] = s_i s_{i + 1} s_{i + 2} ... s_{j - 1} s_j).

Let's call a binary string t of length k beautiful if it is a bit similar to all substrings of s having length exactly k; that is, it is a bit similar to s[1..k], s[2..k+1], ..., s[n-k+1..n].

Your goal is to find the lexicographically smallest string t that is beautiful, or report that no such string exists. String x is lexicographically less than string y if either x is a prefix of y (and x ≠ y), or there exists such i (1 ≤ i ≤ min(|x|, |y|)), that x_i < y_i, and for any j (1 ≤ j < i) x_j = y_j.

Input

The first line contains one integer q (1 ≤ q ≤ 10000) — the number of test cases. Each test case consists of two lines.

The first line of each test case contains two integers n and k (1 ≤ k ≤ n ≤ 10^6). The second line contains the string s, consisting of n characters (each character is either 0 or 1).

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

Output

For each test case, print the answer as follows:

  * if it is impossible to construct a beautiful string, print one line containing the string NO (note: exactly in upper case, you can't print No, for example); 
  * otherwise, print two lines. The first line should contain the string YES (exactly in upper case as well); the second line — the lexicographically smallest beautiful string, consisting of k characters 0 and/or 1. 

Example

Input


7
4 2
0110
4 2
1001
9 3
010001110
9 3
101110001
10 3
0101110001
10 10
1111111111
11 10
11111111110


Output


YES
11
YES
00
YES
010
YES
101
NO
YES
0000000001
YES
0000000010
import java.util.*;
import java.io.*;
public class Edu102E{
	public static void main(String[] main) throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		PrintWriter out = new PrintWriter(System.out);
		int t = Integer.parseInt(st.nextToken());
		for(int trial = 1; trial <= t; trial++){
			st = new StringTokenizer(br.readLine());
			int n = Integer.parseInt(st.nextToken());
			int k = Integer.parseInt(st.nextToken());
			st = new StringTokenizer(br.readLine());
			String s = st.nextToken();
			HashSet<Integer> used = new HashSet<Integer>();
			StringJoiner z = new StringJoiner("");
			for(int i = 0; i < k-20; i++)
				z.add("1");
			String zeros = z.toString();
			int a = k-21;
			while(a >= 0 && s.charAt(a) != '0')
				a--;
			for(int i = 0; i <= n-k; i++) {
				if(k >= 21 && s.charAt(i+k-21) == '0')
					a = i+k-21;
				if(k < 20)
					used.add(Integer.parseInt(s.substring(i, i+k),2));
				else if(k >= 20 && a < i)
					used.add(Integer.parseInt(s.substring(i+k-20, i+k), 2));
			}
			String ans = "";
			boolean yes = true;
			if(k > 20) {
				out.println("YES");
				for(int i = (int)(Math.pow(2,20))-1; i >= 0; i--) {
					if(!used.contains(i)) {
						ans = Integer.toBinaryString(i);
						StringJoiner sj = new StringJoiner("");
						sj.add(zeros);
						for(int j = 0; j < 20 - ans.length(); j++)
							sj.add("0");
						sj.add(ans);
						ans = sj.toString();
						break;
					}
				}
			}
			else {
				if(used.size() == (int)(Math.pow(2,k))) {
					out.println("NO");
					yes = false;
				}
				else
					out.println("YES");
				for(int i = (int)(Math.pow(2,k))-1; i >= 0; i--) {
					if(!used.contains(i)) {
						ans = Integer.toBinaryString(i);
						StringJoiner sj = new StringJoiner("");
						for(int j = 0; j < k - ans.length(); j++)
							sj.add("0");
						sj.add(ans);
						ans = sj.toString();
						break;
					}
				}
			}
			if(yes) {
				StringJoiner sj = new StringJoiner("");
				for(int i =0; i < k; i++) {
					if(ans.charAt(i) == '0')
						sj.add("1");
					else
						sj.add("0");
				}
				out.println(sj);
			}
		}
		out.close();
	}
}