#include <bits/stdc++.h>

using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define pb push_back
#define st first
#define nd second

void solve() {
	int n, k;
    cin >> n >> k;
    int T[n];
    rep(i, n) {
        cin >> T[i];
    }
    int l = 0;
    int r = 0;
    pair<int, int> przedzial[n];
    rep(i, n) {
        if (l >= T[i]) {
            if (l + T[i] <= k) {
                l = l - T[i];
                r = min(r + T[i], r + T[i] + 2 * ((k - (r + T[i]))/2));    
            }
            else {
                int ile = l + T[i];
                l = l - T[i];
                r = 2 * k - ile;
            }
        }
        else {
            if (l + T[i] <= k) {
                if (r - T[i] >= 0) {
                    if ((r - T[i]) % 2 == 0) {
                        l = 0;
                    }
                    else {
                        l = 1;
                    }
                }
                else {
                    l = T[i] - r;
                }
                r = min(r + T[i], r + T[i] + 2 * ((k - (r + T[i]))/2));
            }
            else {
                int ile = l + T[i];
                if (r - T[i] >= 0) {
                    if ((r - T[i]) % 2 == 0) {
                        l = 0;
                    }
                    else {
                        l = 1;
                    }
                }
                else {
                    l = T[i] - r;
                }
                r = 2 * k - ile;
            }
        }
        przedzial[i].st = l;
        przedzial[i].nd = r;
        // cout << "l = " << l << " r = " << r << '\n';
    }
    if (l == 0) {
        cout << "YES" << '\n';
        int W[n + 1][k];
        rep(i, n + 1) {
            rep(j, k) {
                W[i][j] = 0;
            }
        }
        int x = 0;
        for (int i = n - 1; i >= 1; i--) {
            int l = przedzial[i - 1].st;
            int r = przedzial[i - 1].nd;
            int lic = 0;
            rep(ile, x + 1) {
                if (T[i] - ile > k - x) {
                    continue;
                }
                int powst = x - ile + T[i] - ile;
                if (l <= powst && powst <= r) {
                    lic = ile;
                    break;
                }
            }
            int a = 0;
            int b = 0;
            x = 0;
            rep(j, k) {
                if (W[i + 1][j] == 0) {
                    if (b < T[i] - lic) {
                        W[i][j] = 1;
                        b++;
                    }
                    else {
                        W[i][j] = 0;
                    }
                }
                else {
                    if (a < lic) {
                        W[i][j] = 0;
                        a++;
                    }
                    else {
                        W[i][j] = 1;
                    }
                }
                x += W[i][j];
            }
        }
        rep(i, n) {
            rep(j, k) {
                cout << W[i][j];
            }
            cout << '\n';
        }
    }
    else {
        cout << "NO" << '\n';
    }
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t;
	cin >> t;
	while(t--) {
		solve();
	}
	return 0;
}