#include <iostream>
using namespace std;
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <cstring>

using ll = long long;

const int N = 1e6 + 10;

ll n, m;
ll zhi[N];

void init()
{
	for (ll i = 1;i <= 1e6;i++)
		zhi[i] = i * (i - 1) / 2;
}

void solve()
{
	cin >> n >> m;
	ll sn = n * (n + 1) / 2;
	ll sm = m * (m + 1) / 2;
	if (sn % 2 == 1 && sm % 2 == 1)
	{
		cout << "No\n";
		return;
	}
	cout << "Yes\n";
	vector<int> ans;
	if (sn % 2 == 0)
	{
		sn = sn / 2 - n;
		int pos = lower_bound(zhi + 1, zhi + 1 + n, sn) - zhi;
		for (int i = pos;i > 1 && sn > 0;i--)
		{
			while (sn >= zhi[i])
			{
				sn -= zhi[i];
				ans.push_back(i);
			}
		}

		int now = 0;
		bool flag = true;
		string res = "";
		for (auto it : ans)
		{
			for (int i = 1;i <= it;i++)
			{
				if (flag) res += '1';
				else res += '0';
			}
			now += it;
			flag ^= 1;
		}
		for (int i = now;i < n;i++)
		{
			if (flag) res += '1';
			else res += '0';
			flag ^= 1;
		}

		for (int i = 0;i < res.size();i++)
		{
			for (int j = 1;j <= m;j++)
				cout << res[i] << ' ';
			cout << '\n';
		}
	}
	else
	{
		sm = sm / 2 - m;
		int pos = lower_bound(zhi + 1, zhi + 1 + n, sm) - zhi;
		for (int i = pos;i > 1 && sm > 0;i--)
		{
			while (sm >= zhi[i])
			{
				sm -= zhi[i];
				ans.push_back(i);
			}
		}

		int now = 0;
		bool flag = true;
		string res = "";
		for (auto it : ans)
		{
			for (int i = 1;i <= it;i++)
			{
				if (flag) res += '1';
				else res += '0';
			}
			now += it;
			flag ^= 1;
		}
		for (int i = now;i < m;i++)
		{
			if (flag) res += '1';
			else res += '0';
			flag ^= 1;
		}

		for (int i = 1;i <= n;i++)
		{
			for (int j = 0;j < res.size();j++)
				cout << res[j] << ' ';
			cout << '\n';
		}
	}
}

int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int T = 1;
	cin >> T;
	init();
	while (T--)
	{
		solve();
	}
	return 0;
}