#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define x first
#define y second

using namespace std;

typedef long long ll;
typedef long double ld;

vector <vector <int> > solve(int n, int m)
{
 	vector <vector <int> > solut(n, vector <int> (m));

 	ll need = (ll) m * (m + 1) / 4;
 	int ost = m;
 	vector <int> lens;
 	while (ost > 0)
 	{
 	 	int cur = 0;
 	 	while (cur + 1 <= ost && (ll) (cur + 1) * (cur + 2) / 2 + (ost - cur - 1) <= need) cur++;
 	 	lens.pb(cur);
 	 	ost -= cur;
 	 	need -= (ll) cur * (cur + 1) / 2;
 	}

 	int pos = 0, colour = 0;
 	for (int len : lens)
 	{
 		for (int i = 1; i <= len; i++)
 			solut[0][pos++] = colour;
 		colour ^= 1;
 	}	

 	for (int i = 1; i < n; i++)
 		solut[i] = solut[0];
 	return solut;
}

int main()
{
 	//freopen("input.txt", "r", stdin);
 	//freopen("output.txt", "w", stdout);
 	ios_base::sync_with_stdio(0); cin.tie(0);

 	int test;
 	cin >> test;

 	for (int rep = 1; rep <= test; rep++)
 	{
 	 	int n, m;
 	 	cin >> n >> m;

 	 	ll kol = (ll) n * (n + 1) / 2 * m * (m + 1) / 2;
 	 	if (kol % 2 == 1) {cout << "No\n"; continue;}

 	 	cout << "Yes\n";
 	 	
 	 	vector <vector <int> > doska;
 	 	if ((ll) m * (m + 1) / 2 % 2 == 0)
 	 	{
 	 		doska = solve(n, m); 	
 	 	}
 	 	else
 	 	{
 	 	 	vector <vector <int> > cop = solve(m, n);
 	 	 	doska.resize(n, vector <int> (m));
 	 	 	for (int i = 0; i < n; i++)
 	 	 		for (int j = 0; j < m; j++)
 	 	 			doska[i][j] = cop[j][i];
 	 	}

 	 	for (int i = 0; i < n; i++)
 	 	{
 	 	 	for (int j = 0; j < m; j++)
 	 	 		cout << doska[i][j] << ' ';
 	 	 	cout << '\n';
 	 	}
 	}

 	return 0;
}