#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;

#define all(x) (x).begin(), (x).end()

vector<vector<int>> solve(int n, int m) {
  vector<vector<int>> ans(n, vector<int>(m));

  if (n == 1 || m == 1 || m % 2 == 0) {
    int cur = 1;
    for (int i = 0; i < n; ++i)
      for (int j = 0; j < m; ++j)
        ans[i][j] = cur++;
    return ans;
  }

  if (n % 2 == 0) {
    int cur = 1;
    for (int j = 0; j < m; ++j)
      for (int i = 0; i < n; ++i)
        ans[i][j] = cur++;
    return ans;
  }

  vector<int> odd, even;
  for (int i = 1; i <= n * m; ++i) {
    if (i % 2 == 1)
      odd.push_back(i);
    else
      even.push_back(i);
  }

  reverse(all(odd));
  reverse(all(even));

  for (int i = 0; i < n; ++i)
    for (int j = 0; j < m; ++j) {
      if (!odd.empty()) {
        ans[i][j] = odd.back();
        odd.pop_back();
      } else if (!even.empty()) {
        ans[i][j] = even.back();
        even.pop_back();
      }
    }

  return ans;
}

int main() {
#ifndef ONLINE_JUDGE
  freopen("m.txt", "r", stdin);
#endif
  ios_base::sync_with_stdio(false);

  int t;
  cin >> t;
  while (t--) {
    int n, m;
    cin >> n >> m;

    auto ans = solve(n, m);
    cout << "yes\n";
    for (int i = 0; i < n; ++i)
      for (int j = 0; j < m; ++j)
        cout << ans[i][j] << " \n"[j + 1 == m];
  }

  return 0;
}