#include <bits/stdc++.h>
using namespace std;

array<int, 2> get_option(int a, int w, int k)
{
    int begg = a >= w ? a - w : w - a;
    int endd = a <= k - w ? a + w : k - (w - (k - a));
    return {{begg, endd}};
}

void solve()
{
    int n, k;
    cin >> n >> k;
    int begg = 0, endd = 0;
    int parity = 0;
    vector<int> beggs = {};
    vector<int> endds = {};
    vector<int> W = {};

    for (int i = 0; i < n; i++)
    {
        beggs.push_back(begg);
        endds.push_back(endd);
        //cout << "begg, endd: " << begg << " " << endd << "\n";
        int w;
        cin >> w;
        W.push_back(w);
        parity = (parity + w) % 2;
        
        int new_begg = k;
        int new_endd = 0;

        for (int pos = begg; pos <= endd; pos += 2)
        {
            array<int, 2> option = get_option(pos, w, k);
            new_begg = min(new_begg, option[0]);
            new_endd = max(new_endd, option[1]);
        }

        begg = new_begg;
        endd = new_endd;
    }

    if (begg == 0)
    {
        cout << "YES\n";
        for (int i = 0; i < k; i++) cout << "0";
        cout << "\n";

        vector<int> one_counts = {};
        int next_one_count = 0;

        for (int i = n - 1; i >= 0; i--)
        {
            int begg = beggs[i], endd = endds[i], w = W[i];

            for (int pos = begg; pos <= endd; pos += 2)
            {
                array<int, 2> option = get_option(pos, w, k);

                if (option[0] <= next_one_count && next_one_count <= option[1])
                {
                    next_one_count = pos;
                    break;
                }
            }

            one_counts.push_back(next_one_count);
        }

        reverse(one_counts.begin(), one_counts.end());

        int start = 0, len = 0;

        for (int i = 0; i < n - 1; i++)
        {
            int c = one_counts[i], d = one_counts[i + 1];
            int w = W[i];
            int a = (c + w - d) / 2, b = (w + d - c) / 2;
            start = (start + a) % k;
            len += b - a;
            //cout << "c, d, w, a, b: " << c << " " << d << " " << w << " " << a << " " << b << "\n";
            //cout << "start, len: " << start << " " << len << "\n";

            vector<char> answer(k, '0');
            
            if (start + len <= k)
            {
                for (int j = start; j < start + len; j++) answer[j] = '1';
            }
            else
            {
                for (int j = start; j < k; j++) answer[j] = '1';
                for (int j = 0; j < len - (k - start); j++) answer[j] = '1';
            }

            for (char c : answer) cout << c;
            cout << "\n";
        }
    }
    else
    {
        cout << "NO\n";
    }
}

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

    int t;
    cin >> t;
    for (int i = 0; i < t; i++) solve();
}