#include <algorithm>
#include <cstdio>
#include <random>

#define debug(...) fprintf(stderr, __VA_ARGS__)

const int N = 505;

std::mt19937 rnd(std::random_device{}());

int n, R, C;
int c[N], b[N][N], a[N][N];
int deg[N], id[N];

int o[N];
int d, G[N][N];
int tp, st[N], vis[N];
int to[N], rev[N];

void match() {
  tp = 0;
  for (int i = 1; i <= n; ++i) {
    o[i] = i;
    vis[i] = to[i] = rev[i] = 0;
  }
  std::shuffle(o + 1, o + n + 1, rnd);
  for (int t = 1; t <= n; ++t) {
    int u = o[t], v;
    st[tp = 1] = u, vis[u] = t;
    while (1) {
      do {
        v = G[u][rnd() % d];
      } while (v == to[u]);
      if (!rev[v]) break;
      u = rev[v];
      while (vis[u] == t) --vis[st[tp--]];
      vis[st[++tp] = u] = t;
    }
    for (int i = 1; i < tp; ++i)
      to[st[i]] = to[st[i + 1]],
      rev[to[st[i + 1]]] = st[i]; 
    to[u] = v, rev[v] = u;
  }
}

inline bool cmp(int u, int v) {
  return deg[u] < deg[v];
}
inline void upd(int d) {
  int cur1 = 1, cur2 = d + 1;
  static int tmp[N];
  for (int i = 1; i <= n; ++i)
    if (cur2 > n || cur1 <= d && cmp(id[cur1], id[cur2]))
      tmp[i] = id[cur1++];
    else tmp[i] = id[cur2++];
  for (int i = 1; i <= n; ++i) id[i] = tmp[i];
}

void solve() {
  scanf("%d%d%d", &n, &R, &C);
  for (int i = 1; i <= n; ++i) {
    c[i] = 0;
    for (int j = 1; j <= n; ++j) a[i][j] = b[i][j] = 0;
  }
  for (int i = 1; i <= R; ++i)
    for (int j = 1; j <= C; ++j) {
      scanf("%d", &a[i][j]), ++c[a[i][j]];
    }
  for (int i = 1; i <= n; ++i)
    if (R - c[i] > n - C) return puts("No"), void();
  puts("Yes");
  if (C != n) {
    for (int i = 1; i <= n; ++i)
      for (int j = 1; j <= n; ++j) b[i][j] = 0;
    for (int i = 1; i <= R; ++i)
      for (int j = 1; j <= C; ++j) b[i][a[i][j]] = 1;
    for (int i = C + 1; i <= n; ++i) {
      d = n - i + 1;
      for (int j = 1; j <= n; ++j) {
        deg[j] = 0;
        for (int k = 1; k <= R; ++k) if (!b[k][j]) {
          G[j][deg[j]++] = k;
        }
      }
      for (int j = 1; j <= n; ++j) id[j] = j;
      std::sort(id + 1, id + n + 1, cmp);
      for (int k = R + 1; k <= n; ++k) {
        for (int j = 1; j <= d; ++j) 
          G[id[j]][deg[id[j]]++] = k;
        upd(d);
      }
      match();
      for (int j = 1; j <= n; ++j) {
        if (to[j] <= R) a[to[j]][i] = j, b[to[j]][j] = 1;
      }
    }
  }
  if (R != n) {
    for (int i = 1; i <= n; ++i)
      for (int j = 1; j <= n; ++j) b[i][j] = 0;
    for (int i = 1; i <= R; ++i)
      for (int j = 1; j <= n; ++j) b[j][a[i][j]] = 1;
    for (int r = R + 1; r <= n; ++r) {
      d = n - r + 1;
      for (int i = 1; i <= n; ++i) {
        int tmp = 0;
        for (int j = 1; j <= n; ++j)
          if (!b[j][i]) G[i][tmp++] = j;
      }
      match();
      for (int i = 1; i <= n; ++i) a[r][i] = rev[i], b[i][rev[i]] = 1;
    }
  }
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) printf("%d%c", a[i][j], " \n"[j == n]);
}

int main() {
  int t;
  scanf("%d", &t);
  while (t--) solve();
  return 0;
}