// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
struct flow {
   static constexpr int inf = 1e9;
   static const int maxn = 4e2 + 10, maxm = maxn * maxn + maxn * 2 + 10;
   int N, S, T;
   int to[maxm * 2], val[maxn * 2], nxt[maxm * 2], fir[maxn], tot;
   inline flow(int N_, int S_, int T_) {
      N = N_, S = S_, T = T_;
      memset(fir, 0, sizeof(fir));
      tot = 1;
   }
   inline void add(int x, int y, int w, bool f = 1) {
      to[++tot] = y, val[tot] = w, nxt[tot] = fir[x], fir[x] = tot;
      if (f) add(y, x, 0, 0);
   }
   int hd[maxn], dep[maxn];
   inline bool bfs() {
      for (int i = 1; i <= N; i++)
         hd[i] = fir[i], dep[i] = -1;
      dep[S] = 0;
      std::queue<int> Q; Q.push(S);
      while (! Q.empty()) {
         int u = Q.front(); Q.pop();
         if (u == T) return true;
         for (int i = hd[u]; i; i = nxt[i])
            if (dep[to[i]] == -1 && val[i])
               dep[to[i]] = dep[u] + 1, Q.push(to[i]);
      }
      return false;
   }
   inline int dfs(int u, int fl) {
      if (u == T)
         return fl;
      int ud = 0;
      for (int &i = hd[u]; i; i = nxt[i])
         if (dep[u] + 1 == dep[to[i]] && val[i]) {
            int k = dfs(to[i], std::min(fl - ud, val[i]));
            if (! k) dep[to[i]] = -1;
            ud += k, val[i] -= k, val[i ^ 1] += k;
            if (ud == fl)
               return fl;
         }
      return ud;
   }
   inline int Dinic() {
      int ans = 0, f;
      while (bfs())
         while ((f = dfs(S, inf)) > 0)
            ans += f;
      return ans;
   }
};
const int maxn = 2e2 + 10;
int col[maxn][maxn];
int vis[maxn][maxn], cnt[maxn][3];
int main() {
   int n, m; scanf("%d%d", &n, &m);
   for (int i = 1; i <= n; i++)
      for (int j = i + 1; j <= n; j++)
         scanf("%d", &col[i][j]), col[j][i] = col[i][j], cnt[col[i][j]][2]++;
   if (~ m & 1)
      return puts("No"), 0;
   int M = m + 1 >> 1;
   for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++)
         if (vis[col[i][j]][i]++)
            return puts("No"), 0;
      for (int j = 1; j <= m; j++)
         if (! vis[j][i])
            cnt[j][1]++;
   }
   for (int i = 1; i <= m; i++)
      if (cnt[i][2] + cnt[i][1] > M)
         return puts("No"), 0;
   for (int i = 1; i <= m; i++)
      cnt[i][0] = M - cnt[i][1] - cnt[i][2];
   while (n < m + 1) {
      int S, T;
      flow f(m * 2 + 2, S = m * 2 + 1, T = m * 2 + 2);
      for (int i = 1; i <= m; i++)
         f.add(S, i, 1), f.add(m + i, T, 1);
      for (int i = 1, hd = m + n + 1, fl = 0; i <= m; i++) {
         for (int j = 1; j <= n; j++) {
            if (! vis[i][j])
               f.add(i, m + j, 1);
         }
         for (int j = 2 * cnt[i][0]; j; j--) {
            f.add(i, hd, 1), fl++;
            if (fl == m - n + 1) fl = 0, hd++;
         }
      }
      f.Dinic();
      for (int i = 1; i <= m; i++) {
         int to = -1;
         for (int j = f.hd[i]; j; j = f.nxt[j])
            if (! f.val[j])
               to = f.to[j];
         if (to <= m + n)
            col[to - m][n + 1] = i, vis[i][to - m] = vis[i][n + 1] = 1, cnt[i][1]--;
         else
            cnt[i][0]--, cnt[i][1]++;
      }
      n++;
   }
   puts("Yes");
   for (int i = 1; i <= n; i++, puts(""))
      for (int j = i + 1; j <= n; j++)
         printf("%d ", col[i][j]);
   return 0;
}