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
#include <bits/stdc++.h>
using namespace std;

#define FOR(a,b) for (int a=0; a<b; a++)
#define FUR(a,b) for (int a=1; a<=b; a++)
#define ROF(a,b) for (int a=b; a-->0; )
#define RUF(a,b) for (int a=b; a>0; a--)
#define FORR(a,b,c) for (int a=b; a<c; a++)
#define all(v) begin(v),end(v)
#define rall(v) rbegin(v),rend(v)
#define xx first
#define yy second
#define ass assign
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define lb lower_bound 
#define ub upper_bound 

#define ll long long
#define V vector
#define pii pair<int,int>

template<class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (const T& x: v) os << x << ' ';
    return os; }
template<class T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x: v) is >> x;
    return is; }
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << h; if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
template<class T> bool miin(T& a, const T& b) { return a > b ? a=b,1 : 0; }
template<class T> bool maax(T& a, const T& b) { return a < b ? a=b,1 : 0; }

const int MOD = 1e9+7; // 998244353;
const ll INF = 1e18;
const char nl = '\n';
const double PI = acos(-1);
const int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1}; 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); 

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    int q; cin >> q;
    FOR(test,q) {
        int n,k; cin >> n >> k;
        string s; cin >> s;

        V<int> c0(n+1);
        FOR(i,n) c0[i+1] = c0[i] + (s[i]=='0');

        int poss = n-k+1;
        int pre0 = k - ceil(log2(poss + 1));
        pre0 = max(pre0, 0);
        int post = k-pre0;

        cerr << poss << ' ' << pre0 << ' ' << post << '+';

        unordered_set<string> seen;
        FOR(i,poss) {
            if (c0[i] < c0[i+pre0]) continue; // already ok
            string x = s.substr(i+pre0, post);
            seen.insert(x);
        }

        int ans;
        string kek(post,'0');
        int MAX = 1 << post;
        for (ans=0; ans<MAX; ans++) {
            FOR(i,post) kek[post-i-1] =
                ( ans & (1<<i) ? '0' : '1' );
            if (!seen.count(kek)) {
                for (char&c: kek) c = ( c=='0' ? '1' : '0' );
                break;
            } 
        }
        if (ans == MAX) cout << "NO\n";
        else cout << "YES\n" << string(pre0,'0') << kek << nl;
    }
}
