#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

void solve() {
  int n, m;
  cin >> n >> m;
  bool sw = false;
  if (m * (m + 1) / 2 & 1) {
    swap(n, m);
    sw = true;
  }
  if (m * (m + 1) / 2 & 1) {
    cout << "No\n";
    return;
  }
  vector<int> a(m);
  i64 need = i64(m) * (m + 1) / 4;
  assert(m <= need);
  int cnt = m, o = 0, cur = 0;
  for (int i = m; i >= 1; --i) {
    while (i <= cnt && i64(i) * (i + 1) / 2 <= need - (cnt - i)) {
      need -= i64(i) * (i + 1) / 2;
      cnt -= i;
      for (int j = cur; j < cur + i; ++j) a[j] = o;
      cur += i, o ^= 1;
    }
  }
  cout << "Yes\n";
  if (!sw) {
    for (int i = 0; i < n; ++i)
      for (int j = 0; j < m; ++j) cout << a[j] << " \n"[j == m - 1];
  } else {
    for (int j = 0; j < m; ++j)
      for (int i = 0; i < n; ++i) cout << a[j] << " \n"[i == n - 1];
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}