#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 5e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
 
int n;
int m;
 
void solve()
{
	cin >> n >> m;
	ll tot = 1LL * n * m * (n + 1) * (m + 1) / 4;
	if(tot % 2 != 0) cout << "No" << endl;
	else {
		ll cur = 0;
		ll target = 1LL * m * (m + 1) / 4;
		vector<int> value;
		while(target > 0) {
			int lo = 1, hi = m - cur + 1;
			while(lo + 1 < hi) {
				int mid = (lo + hi) / 2;
				if(1LL * mid * (mid + 1) / 2 + m - (cur + mid) > target) hi = mid;
				else lo = mid;
			}
			target -= 1LL * lo * (lo + 1) / 2;
			cur += lo;
			value.pb(lo);
		}
		assert(target == 0 && cur == m);
		cout << "Yes" << endl;
		for(int i = 1; i <= n; i++) {
			for(int j = 0; j < sz(value); j++) {
				for(int k = 0; k < value[j]; k++) cout << (j & 1) << ' ';
			}
			cout << endl;
		}

	}
}
 
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
 
	int tc = 1;
	cin >> tc;
	while(tc--) {
		solve();
	}
	return 0;
}