#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


vector<int> solve(int M) {
  Int tar = 1LL * M * (M + 1) / 2 / 2;
  Int m = M;
  vector<int> ret;
  int s = 0;
  for (; m > 0; ) {
    Int lo = 0, hi = m + 1;
    for (; lo + 1 < hi; ) {
      const Int mid = (lo + hi) / 2;
      ((mid * (mid + 1) / 2 + (m - mid) <= tar) ? lo : hi) = mid;
    }
// cerr<<ret<<" "<<tar<<" "<<m<<" "<<lo<<endl;
    assert(lo > 0);
    for (int i = 0; i < lo; ++i) {
      ret.push_back(s);
    }
    s ^= 1;
    tar -= lo * (lo + 1) / 2;
    m -= lo;
  }
  assert(tar == 0);
  return ret;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    int M, N;
    scanf("%d%d", &M, &N);
    
    if (1LL * M * (M + 1) / 2 % 2 == 0) {
      const auto fs = solve(M);
      puts("Yes");
      for (int x = 0; x < M; ++x) {
        for (int y = 0; y < N; ++y) {
          if (y) printf(" ");
          printf("%d", fs[x]);
        }
        puts("");
      }
    } else if (1LL * N * (N + 1) / 2 % 2 == 0) {
      const auto fs = solve(N);
      puts("Yes");
      for (int x = 0; x < M; ++x) {
        for (int y = 0; y < N; ++y) {
          if (y) printf(" ");
          printf("%d", fs[y]);
        }
        puts("");
      }
    } else {
      puts("No");
    }
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}