#include <bits/stdc++.h>
using namespace std;
int scanst(char *a) {
  int i = 0;
  char c = 0;
  while (c < 33) c = getchar();
  while (c > 33) {
    a[i++] = c;
    c = getchar();
  }
  a[i] = 0;
  return i;
}
template <typename T>
bool scan(T &n) {
  n = 0;
  bool got = false;
  bool negative = false;
  char c = getchar();
  if (c == EOF) return false;
  while (c<'0' | c> '9') {
    if (c == '-') negative = true;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    got = true;
    n = n * 10 + c - 48;
    c = getchar();
  }
  if (negative) n = ~(n - 1);
  return got;
}
template <typename T>
inline T GCD(T a, T b) {
  a = abs(a);
  b = abs(b);
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
template <typename T>
inline T LCM(T x, T y) {
  T tp = GCD(x, y);
  if ((x / tp) * 1. * y > 9e18) return 9e18;
  return (x / tp) * y;
}
template <typename T>
inline T BigMod(T A, T B, T M) {
  T ret = 1;
  while (B) {
    if (B & 1) ret = (ret * A) % M;
    A = (A * A) % M;
    B = B >> 1;
  }
  return ret;
}
template <typename T>
inline T InvMod(T A, T M) {
  return BigMod(A, M - 2, M);
}
long long gcdr(long long a, long long b) {
  if (a == 0) return b;
  return gcdr(b % a, a);
}
long long max(long long a, long long b) {
  if (a > b) return a;
  return b;
}
long long min(long long a, long long b) {
  if (a < b) return a;
  return b;
}
void FastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.precision(20);
}
long long current[300000] = {0};
long long done[300000] = {0};
vector<long long> G[300000];
int main() {
  FastIO();
  long long n, m, p, q, i, j;
  while (cin >> n >> q) {
    set<long long> listt;
    long long zero = 0;
    for (i = 1; i <= n; i++) {
      cin >> current[i];
      if (current[i] == 0) {
        zero = 1;
        continue;
      }
      G[current[i]].push_back(i);
      listt.insert(current[i]);
    }
    long long qfound = 0;
    vector<long long> query;
    for (auto it = listt.begin(); it != listt.end(); ++it) {
      query.push_back(*it);
      if (*it == q) {
        qfound = 1;
      }
    }
    if (zero == 0 && qfound == 0) {
      cout << "NO" << endl;
      continue;
    }
    reverse(query.begin(), query.end());
    long long f = 1;
    for (i = 0; i < query.size(); i++) {
      long long val = query[i];
      sort(G[val].begin(), G[val].end());
      long long beg = G[val][0];
      long long endd = G[val][G[val].size() - 1];
      for (j = beg; j <= endd; j++) {
        if (current[j] != 0 && current[j] != val && current[j] < val) {
          f = 0;
          break;
        }
        if (current[j] > val) {
          j = G[current[j]][G[current[j]].size() - 1];
          continue;
        }
        if (current[j] == 0) {
          current[j] = val;
          if (qfound == 0) {
            current[j] = q;
            qfound = 1;
          }
        }
      }
      if (!f) break;
    }
    if (!qfound) {
      for (i = 1; i <= n; i++) {
        if (current[i] == 0) {
          current[i] = q;
          qfound = 1;
          break;
        }
      }
      if (!qfound) {
        f = 0;
      }
    }
    if (!f) {
      cout << "NO" << endl;
    } else {
      for (i = 1; i <= n; i++) {
        long long pre = i - 1;
        long long post = i + 1;
        if (current[i] != 0) {
          while (current[pre] == 0 && pre >= 1) {
            current[pre] = current[i];
            pre--;
          }
          while (current[post] == 0 && post <= n) {
            current[post] = current[i];
            post++;
          }
        }
      }
      cout << "YES" << endl;
      for (i = 1; i <= n; i++) {
        cout << current[i] << " ";
      }
      cout << endl;
    }
  }
}
