#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const long long Inf = 1e18;
const int N = 2e5 + 10;
const int mod = 0;
long long gi() {
  long long x = 0, o = 1;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') o = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * o;
}
template <typename T>
bool chkmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
};
template <typename T>
bool chkmin(T &a, T b) {
  return a > b ? a = b, 1 : 0;
};
int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
int sub(int a, int b) { return a - b < 0 ? a - b + mod : a - b; }
void inc(int &a, int b) { a = (a + b >= mod ? a + b - mod : a + b); }
void dec(int &a, int b) { a = (a - b < 0 ? a - b + mod : a - b); }
int n, x[N], sum[N];
long long a[N], t, b[N];
int main() {
  cin >> n >> t;
  for (int i = 1; i <= n; i++) a[i] = gi();
  for (int i = 1; i <= n; i++) x[i] = gi();
  for (int i = 1; i <= n; i++) {
    if (x[i] < i) return puts("No"), 0;
    sum[i]++;
    sum[x[i]]--;
  }
  for (int i = 1; i <= n; i++) {
    sum[i] += sum[i - 1];
    b[i] = a[i] + t;
    if (sum[i]) b[i] = a[i + 1] + t;
    chkmax(b[i], b[i - 1] + 1);
  }
  for (int i = 1; i <= n; i++)
    if (x[i] != n && b[x[i]] >= a[x[i] + 1] + t) return puts("No"), 0;
  puts("Yes");
  for (int i = 1; i <= n; i++) printf("%lld ", b[i]);
  return 0;
}
