#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 1010;
const int maxm = 1000100;
const int inf = 0x3f3f3f3f;

int n, m, a[maxn][maxn], b[maxn][maxn], c[maxn][maxn];
int id[maxn][2], head[maxn], len, S, T, nt;

struct edge {
	int to, next, cap, flow;
} edges[maxm];

inline void add_edge(int u, int v, int c, int f) {
	edges[++len].to = v;
	edges[len].next = head[u];
	edges[len].cap = c;
	edges[len].flow = f;
	head[u] = len;
}

struct Dinic {
	int d[maxn], cur[maxn];
	bool vis[maxn];
	
	inline void add(int u, int v, int c) {
		add_edge(u, v, c, 0);
		add_edge(v, u, 0, 0);
	}
	
	inline bool bfs() {
		for (int i = 1; i <= nt; ++i) {
			vis[i] = 0;
			d[i] = -1;
		}
		queue<int> q;
		q.push(S);
		vis[S] = 1;
		d[S] = 0;
		while (q.size()) {
			int u = q.front();
			q.pop();
			for (int i = head[u]; i; i = edges[i].next) {
				edge &e = edges[i];
				if (!vis[e.to] && e.cap > e.flow) {
					vis[e.to] = 1;
					d[e.to] = d[u] + 1;
					q.push(e.to);
				}
			}
		}
		return vis[T];
	}
	
	int dfs(int u, int a) {
		if (u == T || !a) {
			return a;
		}
		int flow = 0, f;
		for (int &i = cur[u]; i; i = edges[i].next) {
			edge &e = edges[i];
			if (d[e.to] == d[u] + 1 && (f = dfs(e.to, min(a, e.cap - e.flow))) > 0) {
				e.flow += f;
				edges[i ^ 1].flow -= f;
				flow += f;
				a -= f;
				if (!a) {
					break;
				}
			}
		}
		return flow;
	}
	
	inline int solve() {
		int flow = 0;
		while (bfs()) {
			for (int i = 1; i <= nt; ++i) {
				cur[i] = head[i];
			}
			flow += dfs(S, inf);
		}
		return flow;
	}
} solver;

int c0[maxn], c1[maxn], c2[maxn];

void solve() {
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; ++i) {
		for (int j = i + 1; j <= n; ++j) {
			scanf("%d", &a[i][j]);
			b[i][j] = a[i][j];
			++c[i][a[i][j]];
			++c[j][a[i][j]];
			++c2[a[i][j]];
		}
	}
	if (m % 2 == 0) {
		puts("No");
		return;
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			if (c[i][j] > 1) {
				puts("No");
				return;
			}
		}
	}
	for (int i = 1; i <= m; ++i) {
		c1[i] = n - c2[i] * 2;
		c0[i] = (m + 1 - c2[i] * 2 - c1[i] * 2) / 2;
		if (c1[i] + c2[i] > (m + 1) / 2) {
			puts("No");
			return;
		}
	}
	for (int t = n + 1; t <= m + 1; ++t) {
		for (int i = 1; i <= nt; ++i) {
			head[i] = 0;
		}
		nt = 0;
		len = 1;
		S = ++nt;
		T = ++nt;
		for (int i = 1; i <= m; ++i) {
			id[i][0] = ++nt;
		}
		for (int i = 1; i <= t; ++i) {
			id[i][1] = ++nt;
		}
		for (int i = 1; i <= m; ++i) {
			solver.add(S, id[i][0], 1);
		}
		for (int i = 1; i < t; ++i) {
			solver.add(id[i][1], T, 1);
		}
		solver.add(id[t][1], T, m - t + 1);
		for (int i = 1; i <= m; ++i) {
			for (int j = 1; j < t; ++j) {
				if (!c[j][i]) {
					solver.add(id[i][0], id[j][1], 1);
				}
			}
		}
		for (int i = 1; i <= m; ++i) {
			solver.add(id[i][0], id[t][1], c0[i] * 2);
		}
		solver.solve();
		for (int i = 1; i <= m; ++i) {
			int u = id[i][0];
			bool fl = 0;
			for (int _ = head[u]; _; _ = edges[_].next) {
				edge &e = edges[_];
				if (e.to >= m + 3 && e.to < m + t + 2 && e.flow) {
					int j = e.to - m - 2;
					c[j][i] = c[t][i] = 1;
					b[j][t] = i;
					fl = 1;
				}
			}
			if (fl) {
				--c1[i];
				++c2[i];
			} else {
				--c0[i];
				++c1[i];
			}
		}
	}
	puts("Yes");
	for (int i = 1; i <= m + 1; ++i) {
		for (int j = i + 1; j <= m + 1; ++j) {
			printf("%d ", b[i][j]);
		}
		putchar('\n');
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}