func_code_string: #include <bits/stdc++.h>   #pragma GCC optimize( -O3 )   using namespace std;   const long long N = 1e6 + 5;   void pairsort(long long a[], long long b[], long long n) {     pair<long long, long long> pairt[n];     for (long long i = 0; i < n; i++) {       pairt[i].first = a[i];       pairt[i].second = b[i];     }     sort(pairt, pairt + n);     for (long long i = 0; i < n; i++) {       a[i] = pairt[i].first;       b[i] = pairt[i].second;     }   }   long long gcd(long long a, long long b) {     if (b == 0) return a;     return gcd(b, a % b);   }   long long isPrime(long long n) {     if (n < 2) return 0;     if (n < 4) return 1;     if (n % 2 == 0 or n % 3 == 0) return 0;     for (long long i = 5; i * i <= n; i += 6)       if (n % i == 0 or n % (i + 2) == 0) return 0;     return 1;   }   long long C(long long n, long long r) {     if (r > n - r) r = n - r;     long long ans = 1;     for (long long i = 1; i <= r; i++) {       ans *= n - r + i;       ans /= i;     }     return ans;   }   long long mod = 1e9 + 7;   long long modexpo(long long x, long long p) {     long long res = 1;     x = x % mod;     while (p) {       if (p % 2) res = res * x;       p >>= 1;       x = x * x % mod;       res %= mod;     }     return res;   }   long long n, t, a[N], b[N], c[N], d[N], x[N];   int32_t main() {     ios::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     ;     cin >> n >> t;     a[n + 1] = 3000000000000000000 - t + 1;     for (long long i = 1; i <= n; i++) cin >> a[i];     for (long long i = 1; i <= n; i++) cin >> x[i];     for (long long i = 1; i <= n; i++)       if (x[i] < x[i - 1] or x[i] < i) return cout <<  No , 0;     for (long long i = 1; i <= n; i++) b[i] = a[x[i] + 1] + t - 1;     for (long long i = n; i > 1; i--)       if (b[i - 1] >= b[i]) b[i - 1] = b[i] - 1;     for (long long i = 1; i <= n; i++) c[i + 1]++, c[x[i] + 1]--, d[x[i] + 1]++;     for (long long i = 1; i <= n; i++) c[i] += c[i - 1];     for (long long i = 1; i <= n; i++)       if (c[i] and a[i] + t > b[i - 1]) return cout <<  No , 0;     for (long long i = 1; i <= n; i++)       if (b[i] < a[i] + t) return cout <<  No , 0;     for (long long i = 1; i <= n; i++)       if (c[i] and d[i]) return cout <<  No , 0;     cout <<  Yes           <<   n ;     for (long long i = 1; i <= n; i++) cout << b[i] <<    ;     return 0;   }   