#include <bits/stdc++.h>

using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1000'000'007LL;
const int N = 5000'007;
int tab[N];
pair<int, int> ran[N];
string answer[N];

void DoAns(int n, int k)
{
    string s(k, '0');
    vector<int> pos0, pos1, a0, a1;
    answer[1] = s;
    for(int i = 0; i < k; ++i)
        pos0.pb(i);
    for(int i = 2; i <= n; ++i)
    {
        answer[i] = answer[i - 1];
        int xd = tab[i - 1];
        //cerr << "Da: " << i << "\n";
        while(xd--)
        {
            //cerr << pos0.size() << " " << pos1.size() << "\n";
            if((int)pos0.size() == 0 || ((int)pos1.size() > 0 && (int)pos1.size() + (int)a1.size() > ran[i].st))
            {
                answer[i][pos1.back()] = '0';
                a0.pb(pos1.back()); pos1.pop_back();
            }else
            {
                answer[i][pos0.back()] = '1';
                a1.pb(pos0.back()); pos0.pop_back();
            }
        }
        for(int i = 0; i < (int)a0.size(); ++i)
            pos0.pb(a0[i]);
        for(int i = 0; i < (int)a1.size(); ++i)
            pos1.pb(a1[i]);
        a1.clear();
        a0.clear();
    }
}

void Solve()
{
    int n, k;
    cin >> n >> k;
    for(int i = 1; i <= n; ++i)
        cin >> tab[i];
    ran[n] = make_pair(tab[n], tab[n]);
    for(int i = n - 1; i >= 1; --i)
    {
        ran[i].st = -1;
        for(int j = 0; j <= k; ++j)
        {
            int mi = j - min(j, tab[i]) + (tab[i] - min(j, tab[i]));
            int ma = j + min((k - j), tab[i]) - (tab[i] - min(k - j, tab[i]));
            if(mi % 2 != ran[i + 1].st % 2) continue;
            if(mi > ran[i + 1].nd || ma < ran[i + 1].st) continue;
            if(ran[i].st == -1)
                ran[i].st = j;
            ran[i].nd = j;
        }
    }
    if(ran[1].st % 2 == 1 || ran[1].st > 0)
    {
        cout << "NO\n";
        return;
    }
    DoAns(n, k);
    cout << "YES\n";
    for(int i = 1; i <= n; ++i)
        cout << answer[i] << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t; cin >> t;
    while(t--)
        Solve();

    return 0;
}