#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 <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#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; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
// Barrett
struct ModInt {
  static unsigned M;
  static unsigned long long NEG_INV_M;
  static void setM(unsigned m) { M = m; NEG_INV_M = -1ULL / M; }
  unsigned x;
  ModInt() : x(0U) {}
  ModInt(unsigned x_) : x(x_ % M) {}
  ModInt(unsigned long long x_) : x(x_ % M) {}
  ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) {
    const unsigned long long y = static_cast<unsigned long long>(x) * a.x;
    const unsigned long long q = static_cast<unsigned long long>((static_cast<unsigned __int128>(NEG_INV_M) * y) >> 64);
    const unsigned long long r = y - M * q;
    x = r - M * (r >= M);
    return *this;
  }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
unsigned ModInt::M;
unsigned long long ModInt::NEG_INV_M;
// !!!Use ModInt::setM!!!
////////////////////////////////////////////////////////////////////////////////

using Mint = ModInt;

// M: prime
Mint primitiveRoot() {
  const unsigned M = Mint::M;
  vector<unsigned> ds;
  {
    unsigned m = M - 1;
    for (unsigned q = 2; q * q <= m; ++q) if (m % q == 0) {
      do { m /= q; } while (m % q == 0);
      ds.push_back((M - 1) / q);
    }
    if (m > 1) ds.push_back((M - 1) / m);
  }
  for (unsigned a = 1; a < M; ++a) {
    const Mint g = a;
    if ([&]() -> bool {
      for (const unsigned d : ds) if (g.pow(d).x == 1) return false;
      return true;
    }()) {
      return g;
    }
  }
  assert(false);
}


vector<vector<Mint>> solve(int N, int R) {
  const int P = N*N + 1;
  Mint::setM(P);
  
  if (N == 1 && R == 0) return {};
  if (N == 1 && R == 1) return vector<vector<Mint>>{{1}};
  if (N == 3 && R == 0) return vector<vector<Mint>>{{1,2,3},{4,5,6},{7,8,9}};
  for (int d = 2; d < P; ++d) if (P % d == 0) return {};
  assert(N % 2 == 0);
  if (Mint(R).pow(N*N/4) != -1) return {};
  
  const Mint G = primitiveRoot();
  vector<vector<Mint>> a(N, vector<Mint>(N));
  for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) {
    int qx = x >> 1, rx = x & 1;
    int qy = y >> 1, ry = y & 1;
    if (ry) qx = N - 1 - qx;
    if (rx) qy = N - 1 - qy;
    a[x][y] = G.pow(qx * (2*N) + qy * 4 + rx * 2 + ry);
  }
  const Mint prod = a[0][0] * a[0][1] * a[1][0] * a[1][1];
  for (int x = 0; x < N - 1; ++x) for (int y = 0; y < N - 1; ++y) {
    assert(prod == a[x][y] * a[x][y + 1] * a[x + 1][y] * a[x + 1][y + 1]);
  }
  for (int c = 1; c < P; ++c) {
    if (prod * Mint(c).pow(4) == R) {
      for (int x = 0; x < N; ++x) for (int y = 0; y < N; ++y) {
        a[x][y] *= c;
      }
      return a;
    }
  }
  assert(false);
}

void stress() {
  for (int N = 1; N <= 50; ++N) {
    vector<int> rs;
    for (int R = 0; R <= N*N; ++R) {
      const auto a = solve(N, R);
      if (a.size()) {
        rs.push_back(R);
        Mint::setM(N*N + 1);
        for (int x = 0; x < N - 1; ++x) for (int y = 0; y < N - 1; ++y) {
          assert(a[x][y] * a[x][y + 1] * a[x + 1][y] * a[x + 1][y + 1] == R);
        }
      }
    }
    cerr << "N = " << N << ": rs = " << rs << endl;
  }
}

int main() {
  // stress();
  
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    int N, R;
    scanf("%d%d", &N, &R);
    
    const auto ans = solve(N, R);
    if (ans.size()) {
      puts("Yes");
      for (int x = 0; x < N; ++x) {
        for (int y = 0; y < N; ++y) {
          if (y) printf(" ");
          printf("%u", ans[x][y].x);
        }
        puts("");
      }
    } else {
      puts("No");
    }
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}