#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
const int N=205;
int n,m,c0[N],c1[N],c2[N],col[N][N],vis[N][N];
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[maxm * 2], nxt[maxm * 2], fir[maxn], tot;
    inline flow(int N_, int S_, int T_) {
        N = N_, S = S_, T = T_;
    }
    inline void clear() {
        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;
    }
};    

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>m;
    if(m%2==0){
        cout<<"No\n";
        return 0;
    }
    for(int i=1;i<=n;i++){
        for(int j=i+1;j<=n;j++){
            cin>>col[i][j];
            col[j][i]=col[i][j];
            c2[col[i][j]]++;
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(vis[col[i][j]][i]++){
                cout<<"No\n";
                return 0;
            }
        }
        for(int j=1;j<=m;j++){
            if(!vis[j][i]){
                c1[j]++;
            }
        }
    }
    for(int i=1;i<=m;i++){
        if(c1[i]+c2[i]>(m+1)/2){
            cout<<"No\n";
            return 0;
        }
    }
    int S=m*2+1,T=S+1;
    static flow f(m*2+2,S,T);
    while(n<=m){
        f.clear();
        for(int i=1;i<=m;i++){
            f.add(S,i,1);
        }
        for(int i=1;i<=m;i++){
            for(int j=1;j<=n;j++){
                if(!vis[i][j]){
                    f.add(i,m+j,1);
                }
            }
            for(int j=1;j<=2*c0[i];j++){
                f.add(i,n+m+1,1);
            }
        }
        for(int i=1;i<=n;i++){
            f.add(i+m,T,1);
        }
        for(int i=1;i<=m-n;i++){
            f.add(n+m+1,T,1);
        }
        f.Dinic();
        for(int i=1,to;i<=m;i++){
            for(int j=f.hd[i];j;j=f.nxt[j]){
                if(!f.val[j]){
                    to=f.to[j];
                }
            }
            if(to<=n+m){
                col[to-m][n+1]=i,vis[i][to-m]=vis[i][n+1]=1,c1[i]--;
            }
            else{
                c0[i]--,c1[i]++;
            }
        }
        n++;
    }
    cout<<"Yes\n";
    for(int i=1;i<=m+1;i++){
        for(int j=i+1;j<=m+1;j++){
            cout<<col[i][j]<<' ';
        }
        cout<<'\n';
    }
    return 0;
}