#pragma GCC optimize ("Ofast") #include using namespace std; template struct cLtraits_identity{ using type = T; } ; template using cLtraits_try_make_signed = typename conditional< is_integral::value, make_signed, cLtraits_identity >::type; template struct cLtraits_common_type{ using tS = typename cLtraits_try_make_signed::type; using tT = typename cLtraits_try_make_signed::type; using type = typename common_type::type; } ; template inline auto max_L(S a, T b) -> typename cLtraits_common_type::type{ return (typename cLtraits_common_type::type) a >= (typename cLtraits_common_type::type) b ? a : b; } inline int my_getchar_unlocked(){ static char buf[1048576]; static int s = 1048576; static int e = 1048576; if(s == e && e == 1048576){ e = fread_unlocked(buf, 1, 1048576, stdin); s = 0; } if(s == e){ return EOF; } return buf[s++]; } inline void rd(int &x){ int k; int m=0; x=0; for(;;){ k = my_getchar_unlocked(); if(k=='-'){ m=1; break; } if('0'<=k&&k<='9'){ x=k-'0'; break; } } for(;;){ k = my_getchar_unlocked(); if(k<'0'||k>'9'){ break; } x=x*10+k-'0'; } if(m){ x=-x; } } struct MY_WRITER{ char buf[1048576]; int s; int e; MY_WRITER(){ s = 0; e = 1048576; } ~MY_WRITER(){ if(s){ fwrite_unlocked(buf, 1, s, stdout); } } } ; MY_WRITER MY_WRITER_VAR; void my_putchar_unlocked(int a){ if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){ fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout); MY_WRITER_VAR.s = 0; } MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a; } inline void wt_L(char a){ my_putchar_unlocked(a); } inline void wt_L(int x){ int s=0; int m=0; char f[10]; if(x<0){ m=1; x=-x; } while(x){ f[s++]=x%10; x/=10; } if(!s){ f[s++]=0; } if(m){ my_putchar_unlocked('-'); } while(s--){ my_putchar_unlocked(f[s]+'0'); } } inline void wt_L(const char c[]){ int i=0; for(i=0;c[i]!='\0';i++){ my_putchar_unlocked(c[i]); } } int N; int Q; int A[100000]; int B[100000]; int res[100000]; int main(){ int i; set s; rd(N); rd(Q); { int Lj4PdHRW; for(Lj4PdHRW=(0);Lj4PdHRW<(Q);Lj4PdHRW++){ rd(A[Lj4PdHRW]);A[Lj4PdHRW] += (-1); } } { int e98WHCEY; for(e98WHCEY=(0);e98WHCEY<(Q);e98WHCEY++){ rd(B[e98WHCEY]);B[e98WHCEY] += (-1); } } for(i=(0);i<(N);i++){ s.insert(i); } while(s.size()){ i = *s.begin(); s.erase(i); while(res[i] == A[i] || res[i] == B[i]){ res[i]++; } if(i-1 >= 0 && res[i-1] < res[i]-1){ res[i-1] = res[i] - 1; s.insert(i-1); } if(i+1 < Q && res[i+1] < res[i]-1){ res[i+1] = res[i] - 1; s.insert(i+1); } } int tU__gIr_; int a2conNHc; if(Q==0){ a2conNHc = 0; } else{ a2conNHc = res[0]; for(tU__gIr_=(1);tU__gIr_<(Q);tU__gIr_++){ a2conNHc = max_L(a2conNHc, res[tU__gIr_]); } } if(a2conNHc>= N){ wt_L("NO"); wt_L('\n'); return 0; } wt_L("YES"); wt_L('\n'); wt_L(res[0]+1); wt_L('\n'); for(i=(0);i<(Q);i++){ wt_L(res[i]+1); wt_L('\n'); } return 0; } // cLay version 20210508-1 [beta] // --- original code --- // int N, Q, A[1d5], B[]; // int res[1d5]; // { // set s; // rd(N,Q,(A--)(Q),(B--)(Q)); // // rep(i,N) s.insert(i); // while(s.size()){ // i = *s.begin(); // s.erase(i); // while(res[i] == A[i] || res[i] == B[i]) res[i]++; // if(i-1 >= 0 && res[i-1] < res[i]-1) res[i-1] = res[i] - 1, s.insert(i-1); // if(i+1 < Q && res[i+1] < res[i]-1) res[i+1] = res[i] - 1, s.insert(i+1); // } // // if(max(res(Q)) >= N) wt("NO"), return 0; // // wt("YES"); // wt(res[0]+1); // rep(i,Q) wt(res[i]+1); // }