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

int main() {
  #define taskname "F"
  for (string iext : {"in", "inp"}) {
    if (fopen((taskname"." + iext).c_str(), "r")) {
      freopen((taskname"." + iext).c_str(), "r", stdin);
      freopen(taskname".out", "w", stdout);
      break;
    }
  }

  cin.tie(0)->sync_with_stdio(0);

  int n, m, tt = 1;
  cin >> tt;
  while (tt--) {
    auto sol = [&]() {
        cin >> n >> m;
        long long sm = 1ll * n * (n + 1) * m * (m + 1) >> 2;
        if (sm & 1) return cout << "No\n", 0;
        sm = 1ll * n * (n + 1) >> 1;
        bool check = sm & 1;
        if (check) swap(n, m);
        sm = 1ll * n * (n + 1) >> 2;
        vector<vector<int>> a(n, vector<int>(m));
        auto rot = [&]() {
            vector<vector<int>> b(m, vector<int>(n));
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) b[j][i] = a[i][j];
            }
            swap(a, b);
            swap(n, m);
        };

        // cerr << sm << " " << n << "\n";
        for (int l = 0, e = 0, u = 0; l < n; e ^= 1, l += u) {
            // int lo = 1, hi = (sqrt(sm * 8 + 1) - 1) / 2;
            // cerr << lo << " " << hi << " ";
            // while (lo <= hi) {
                // int md = lo + hi >> 1;
                // if (1ll * md * (md + 1) / 2 + 1ll * (n - l - md) * (n - l - md + 1) / 2 <= sm) lo = md + 1;
                // else hi = md - 1;
            // }
            // u = lo - 1;
            u = 0;
            while (1ll * (u + 1) * (u + 2) / 2 + n - l - u - 1 <= sm) u++;
            // cerr << "(" << u << " " << sm << ") ";
            for (int i = l; i < l + u; i++) {
                for (int j = 0; j < m; j++) a[i][j] = e;
            }
            sm -= 1ll * u * (u + 1) >> 1;
        }

        if (check) rot();

        cout << "Yes\n";
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) cout << a[i][j] << " ";
            cout << "\n";
        }
        return 0;
    };
    sol();
  }
  
  return 0;
}