// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
#ifndef DEBUG
#define cerr if (0) cerr
#endif
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 50;
int t;
int n, m;
int ans[MAXN * MAXN * MAXN];
bool g[MAXN][MAXN];
int main() {
#ifndef DEBUG
ios::sync_with_stdio(0), cin.tie(0);
#endif
cin >> t;
while (t--) {
cin >> n >> m;
REP (i, 0, n * n * n) {
ans[i] = -1;
}
REP (msk, 0, 1 << (2 * n - 2)) {
if (__builtin_popcount(msk) != n - 1) {
continue;
}
int z = 0;
vi v;
REP (i, 0, 2 * n - 2) {
if (msk >> i & 1 ^ 1) {
v.pb(z);
} else {
z++;
}
}
REP (i, 1, n) {
REP (j, 0, i) {
g[i][j] = j >= v[i - 1];
g[j][i] = g[i][j] ^ 1;
}
}
int cnt = 0;
REP (i, 0, n) {
REP (j, 0, i) {
REP (k, 0, j) {
if (g[i][j] == g[j][k] && g[j][k] == g[k][i]) {
cnt++;
}
}
}
}
ans[cnt] = msk;
}
cout << n << ":";
REP (i, 0, n * n * n) {
if (ans[i] != -1) {
cout << ' ' << i;
}
}
cout << '\n';
continue;
if (ans[m] == -1) {
cout << "No\n";
continue;
}
cout << "Yes\n";
int msk = ans[m];
int z = 0;
vi v;
REP (i, 0, 2 * n - 2) {
if (msk >> i & 1 ^ 1) {
v.pb(z);
} else {
z++;
}
}
REP (i, 1, n) {
REP (j, 0, i) {
cout << (j >= v[i - 1]);
}
cout << '\n';
}
/*
// 1 + 2 + ... + n - 1 = n * (n - 1) / 2
REP (msk, 0, 1 << (n * (n - 1) / 2)) {
int tmsk = msk;
REP (i, 1, n) {
REP (j, 0, i) {
g[i][j] = tmsk & 1;
g[j][i] = g[i][j] ^ 1;
tmsk >>= 1;
}
}
int cnt = 0;
REP (i, 0, n) {
REP (j, 0, i) {
REP (k, 0, j) {
if (g[i][j] == g[j][k] && g[j][k] == g[k][i]) {
cnt++;
}
}
}
}
ans[cnt] = msk;
}
if (ans[m] == -1) {
cout << "No\n";
continue;
}
cout << "Yes\n";
int tmsk = ans[m];
REP (i, 1, n) {
REP (j, 0, i) {
cout << (tmsk & 1);
tmsk >>= 1;
}
cout << '\n';
}
*/
}
}
