#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;
        if (n & 1 && m & 1) return cout << "No\n", 0;
        long long sm = 1ll * n * (n + 1) * m * (m + 1) >> 2;
        if (sm & 1) return cout << "No\n", 0;
        bool check = n & 1;
        if (check) swap(n, m);
        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);
        };

        if (m & 1) {
            for (int i = 0; i < n / 2; i++) {
                for (int j = 0; j < m; j++) a[i][j] = i + 1 < n / 2 || j + 1 < m;
            }
            for (int i = 1; i < m; i++) a[n / 2][i] = 1;
        }
        else {
            for (int i = 0; i < n / 2; i++) {
                for (int j = 0; j < m; j++) a[i][j] = i + 1 < n / 2 || j + 1 < m;
            }
            a[n / 2][0] = 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;
}