#include <bits/stdc++.h>
using namespace std;
const int INF = 1061109567;
const long long LINF = 4557430888798830399ll;
const int MOD = 1000000007;
template <typename T>
void read(T &x) {
  x = 0;
  char c = getchar();
  if (c == EOF) exit(0);
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) {
    x = x * 10 + (c - '0');
    c = getchar();
  }
  assert(c != EOF);
}
int reads(char *s) {
  int l = 0;
  *s = getchar();
  if (*s == EOF) exit(0);
  while (*s != ' ' && *s != '\t' && *s != '\r' && *s != '\n' && *s != EOF) {
    ++s;
    ++l;
    *s = getchar();
  }
  assert(*s != EOF);
  *s = '\0';
  return l;
}
long long qpow(long long x, long long n) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % MOD;
    x = x * x % MOD;
    n >>= 1;
  }
  return res;
}
long long a[200005];
int x[200005];
long long b[200005];
void test_case() {
  int n;
  long long t;
  scanf("%d%lld", &n, &t);
  for (int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
  for (int i = 1; i <= n; ++i) scanf("%d", &x[i]);
  for (int i = 1; i <= n; ++i) {
    if (x[i] < x[i - 1] || x[i] < i) {
      puts("No");
      return;
    }
  }
  b[n] = a[n] + t + 1;
  for (int i = n - 1; i >= 1; --i) {
    b[i] = a[i + 1] + t - (x[i] == i);
    if (b[i] == b[i + 1]) {
      puts("No");
      return;
    }
  }
  for (int i = n, lst = n; i; --i) {
    if (lst != x[i] || b[i] <= b[i - 1]) {
      puts("No");
      return;
    }
    if (b[i - 1] - a[i] < t) lst = i - 1;
  }
  puts("Yes");
  for (int i = 1; i <= n; ++i) printf("%lld%c", b[i], " \n"[i == n]);
}
int main() {
  int t = 1;
  for (int i = 1; i <= t; ++i) {
    test_case();
  }
}
