import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const K = readInt;
      auto P = new int[][](N - 1, N);
      foreach (x; 0 .. N - 1) foreach (u; 0 .. N) {
        P[x][u] = readInt - 1;
      }
      
      /*
        0   <- ... <- a
        N-1 <- ... <- b
      */
      alias Edge = Tuple!(int, "x", int, "v");
      Edge[][2] paths;
      foreach (h; 0 .. 2) {
        paths[h] = new Edge[N];
        paths[h][] = Edge(-1, -1);
      }
      int a = 0, b = N - 1;
      paths[0][a] = paths[1][b] = Edge(-2, -2);
      int r = -1;
      foreach (x; 0 .. N - 1) {
        if (~P[x][a]) {
          paths[0][P[x][a]] = Edge(x, a);
          a = P[x][a];
          if (~paths[1][a].x) r = a;
        } else if (~P[x][b]) {
          paths[1][P[x][b]] = Edge(x, b);
          b = P[x][b];
          if (~paths[0][b].x) r = b;
        } else {
          assert(false);
        }
        if (~r) break;
      }
      debug {
        writeln("paths = ", paths);
        writeln("r = ", r);
      }
      assert(~r);
      
      auto used = new bool[N - 1];
      auto ans = new int[N];
      ans[] = -1;
      ans[r] = -2;
      foreach (h; 0 .. 2) {
        for (int u = r; ; ) {
          const x = paths[h][u].x;
          const v = paths[h][u].v;
          debug writefln("%s %s; %s -> %s", h, x, u, v);
          if (x == -2) break;
          used[x] = true;
          ans[v] = x;
          u = v;
        }
      }
      debug {
        writeln("ans = ", ans);
        writeln("used = ", used);
      }
      
      foreach (x; 0 .. N - 1) if (!used[x]) {
        foreach (u; 0 .. N) if (~P[x][u]) {
          if (~ans[P[x][u]] && !~ans[u]) {
            used[x] = true;
            ans[u] = x;
            break;
          }
        }
        assert(used[x]);
      }
      
      writeln("Yes");
      foreach (u; 0 .. N) {
        if (u) write(" ");
        write((r != u) ? (ans[u] + 1) : 0);
      }
      writeln;
    }
  } catch (EOFException e) {
  }
}