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; }
real readReal() { return readToken.to!real; }

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)); }


int L, N;
int[] A;

int[][] graph;
int zeit;
int[] vis, fin;

bool dfs(int u) {
  vis[u] = 1;
  foreach (v; graph[u]) {
    if (vis[v] == 0) {
      if (!dfs(v)) {
        return false;
      }
    } else if (vis[v] == 1) {
      return false;
    }
  }
  vis[u] = 2;
  fin[u] = zeit++;
  return true;
}

void main() {
  try {
    for (; ; ) {
      L = readInt();
      N = readInt();
      A = new int[L];
      foreach (i; 0 .. L) {
        A[i] = readInt() - 1;
      }
      
      bool ans = true;
      foreach (i; 0 .. L - 2) {
        ans = ans && (A[i] != A[i + 2]);
      }
      
      graph = new int[][N];
      foreach (i; 0 .. L - 2) {
        if (i % 2 == 0) {
          graph[A[i]] ~= A[i + 1];
        } else {
          graph[A[i + 1]] ~= A[i];
        }
      }
      zeit = 0;
      vis = new int[N];
      fin = new int[N];
      foreach (u; 0 .. N) {
        if (vis[u] == 0) {
          ans = ans && dfs(u);
        }
      }
      
      if (ans) {
        writeln("Yes");
        foreach (u; 0 .. N) {
          if (u > 0) write(" ");
          write(fin[u] + 1);
        }
        writeln;
      } else {
        writeln("No");
      }
      
      debug {
        writeln(A.map!(u => fin[u]));
      }
    }
  } catch (EOFException e) {
  }
}