// 

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, ##__VA_ARGS__)
#else
#define endl "\n"
#define debug(...) void(0)
#endif
typedef long long LL;
vector<int> knapsack(int n, LL m) {
  // (n, m)
  // (x, (x - 1) * x / 2)
  vector<int> ret;
  while (m) {
    LL x = sqrt(x);
    while (x * (x + 1) / 2 <= m) x += 1;
    while (x * (x - 1) / 2 > m) x -= 1;
    ret.push_back(x);
    n -= x;
    m -= x * (x - 1) / 2;
  }
  assert(n >= 0);
  ret.insert(ret.end(), n, 1);
  return ret;
}
auto solve(int n) { return knapsack(n, 1ll * n * (n + 1) / 4 - n); }
int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);  
#endif
  int t;
  cin >> t;
  while(t--) {
  int n, m;
  cin >> n >> m;
  if (1ll * m * (m + 1) % 4 == 0) {
    string s;
    auto ret = solve(m);
    int c = 0;
    for (int len : ret) s.append(len, c + '0'), c ^= 1;
    cout << "Yes" << endl;
    for (int i = 1; i <= n; i++) for (int i = 0; i < m; i++) cout << s[i] << " \n"[i + 1 == m];
  } else if (1ll * n * (n + 1) % 4 == 0) {
    string s;
    auto ret = solve(n);
    int c = 0;
    for (int len : ret) s.append(len, c + '0'), c ^= 1;
    cout << "Yes" << endl;
    for (auto ch : s) for (int i = 0; i < m; i++) cout << ch << " \n"[i + 1 == m];
  } else {
    cout << "No" << endl;
  }
  }
  return 0;
}