#include <set>
#include <map>
#include <list>
#include <queue>
#include <cmath>
#include <time.h>
#include <random>
#include <bitset>
#include <vector>
#include <cstdio>
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include <memory.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define mk make_pair
#define fi first
#define se second

inline int read(){
	int t = 0,f = 1;
	register char c = getchar();
	while (c < 48 || c > 57) f = (c == '-') ? -1 : 1,c = getchar();
	while (c >= 48 && c <= 57) t = (t << 1) + (t << 3) + (c ^ 48),c = getchar();
	return f * t;
}

const int N = 1e6 + 10;
int T,n,m;
ll val[N];

vector <int> res;

map <ll,bool> mp[N];

bool dfs(int n,ll s){
	if (n < 0) return 0;
	if (1ll * n * (n + 1) / 2 < s) return 0;
	if (mp[n].find(s) != mp[n].end()){
		if (!mp[n][s]) return 0;
	}
	if (n > s) return 0;
	if (n == 0) return s == 0;
	int x = 0;
	// if(s<=2*n)x=3;
	// else if(s<=3*n)x=5;
	x=upper_bound(val + 1,val + 1000001,s) - val - 1;
	for (int p = x;p > 0;p--){
		res.emplace_back(p);
		if (dfs(n - p,s - val[p])) {mp[n][s] = 1;return 1;}
		res.pop_back();
	}
	mp[n][s] = 0;
	return 0;
}

void init(){
	for (int i = 1;i <= 1000000;i++) val[i] = 1ll * i * (i + 1) / 2;
}

void solve(){
	res.clear();
	n = read(),m = read();
	bool f = 0;
	if ((n & 3) == 1 || (n & 3) == 2) swap(n,m),f = 1;
	if ((n & 3) == 1 || (n & 3) == 2) {puts("No");return ;}
	dfs(n,1ll * n * (n + 1) / 4);
	puts("Yes");
	if (f){
		for (int i = 1;i <= m;i++){
			int c = 0;
			for (int p : res){
				for (int j = 1;j <= p;j++) cout << c << ' ';
				c ^= 1;
			}
			puts("");
		}
	}else{
		int c = 0;
		for (int p : res){
			for (int j = 1;j <= p;j++){
				for (int k = 1;k <= m;k++) cout << c << ' ';cout << '\n';
			}
			c ^= 1;
		}
	}
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
	freopen("out.out","w",stdout);
#endif
	init();
	T = read();
	while (T--) solve();
	return 0;
}