#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++) #define per(x, s, t) for(llint (x) = (s); (x) >= (t); (x)--) #define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++) #define chmin(x, y) (x) = min((x), (y)) #define chmax(x, y) (x) = max((x), (y)) #define sz(x) ((ll)(x).size()) #define ceil(x, y) (((x)+(y)-1) / (y)) #define all(x) (x).begin(),(x).end() #define outl(...) dump_func(__VA_ARGS__) #define inf 1e18 using namespace std; typedef long long llint; typedef long long ll; typedef pair P; struct edge{ ll to, cost; edge(){} edge(ll a, ll b){ to = a, cost = b;} }; const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1}; //const ll mod = 1000000007; const ll mod = 998244353; struct mint{ ll x = 0; mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;} mint(const mint &ope) {x = ope.x;} mint operator-(){return mint(-x);} mint operator+(const mint &ope){return mint(x) += ope;} mint operator-(const mint &ope){return mint(x) -= ope;} mint operator*(const mint &ope){return mint(x) *= ope;} mint operator/(const mint &ope){return mint(x) /= ope;} mint& operator+=(const mint &ope){ x += ope.x; if(x >= mod) x -= mod; return *this; } mint& operator-=(const mint &ope){ x += mod - ope.x; if(x >= mod) x -= mod; return *this; } mint& operator*=(const mint &ope){ x *= ope.x, x %= mod; return *this; } mint& operator/=(const mint &ope){ ll n = mod-2; mint mul = ope; while(n){ if(n & 1) *this *= mul; mul *= mul; n >>= 1; } return *this; } mint inverse(){return mint(1) / *this;} bool operator ==(const mint &ope){return x == ope.x;} bool operator !=(const mint &ope){return x != ope.x;} }; mint modpow(mint a, ll n){ if(n == 0) return mint(1); if(n % 2) return a * modpow(a, n-1); else return modpow(a*a, n/2); } istream& operator >>(istream &is, mint &ope){ ll t; is >> t, ope.x = t; return is; } ostream& operator <<(ostream &os, mint &ope){return os << ope.x;} ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;} bool exceed(ll x, ll y, ll m){return x >= m / y + 1;} void mark(){ cout << "*" << endl; } void yes(){ cout << "YES" << endl; } void no(){ cout << "NO" << endl; } ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;} ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);} ll lcm(ll a, ll b){return a/gcd(a, b)*b;} ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;} ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;} string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;} ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;} template void uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());} template ostream& operator << (ostream& os, vector& vec) { for(int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " "); return os; } template ostream& operator << (ostream& os, deque& deq) { for(int i = 0; i < deq.size(); i++) os << deq[i] << (i + 1 == deq.size() ? "" : " "); return os; } template ostream& operator << (ostream& os, pair& pair_var) { os << "(" << pair_var.first << ", " << pair_var.second << ")"; return os; } template ostream& operator << (ostream& os, const pair& pair_var) { os << "(" << pair_var.first << ", " << pair_var.second << ")"; return os; } template ostream& operator << (ostream& os, map& map_var) { for(typename map::iterator itr = map_var.begin(); itr != map_var.end(); itr++) { os << "(" << itr->first << ", " << itr->second << ")"; itr++; if(itr != map_var.end()) os << ","; itr--; } return os; } template ostream& operator << (ostream& os, set& set_var) { for(typename set::iterator itr = set_var.begin(); itr != set_var.end(); itr++) { os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--; } return os; } template ostream& operator << (ostream& os, multiset& set_var) { for(typename multiset::iterator itr = set_var.begin(); itr != set_var.end(); itr++) { os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--; } return os; } template void outa(T a[], ll s, ll t){ for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";} cout << endl; } void dump_func() {cout << endl;} template void dump_func(Head &&head, Tail &&... tail) { cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...); } typedef pair T; ll n, Q; ll a[100005], b[100005]; vector vec[100005]; bool valid[100005]; set S; vector tmp; int main(void) { ios::sync_with_stdio(0); cin.tie(0); cin >> n >> Q; rep(i, 1, Q) cin >> a[i]; rep(i, 1, Q) cin >> b[i]; rep(i, 1, n) vec[i].push_back(T(P(-1, -1), 0)), valid[i] = true; rep(i, 1, Q){ ll x = a[i], y = b[i]; tmp.clear(); for(auto p : S){ if(p == x || p == y) continue; if(p-1 >= 1 && valid[p-1]){ tmp.push_back(p), vec[p].push_back(T(P(p-1, sz(vec[p-1])-1), i)); } if(p+1 <= n && valid[p+1]){ tmp.push_back(p), vec[p].push_back(T(P(p+1, sz(vec[p+1])-1), i)); } } for(auto p : tmp) S.erase(p), valid[p] = true; valid[x] = valid[y] = false, S.insert(x), S.insert(y); } //rep(i, 1, n) outl(vec[i]); ll p = 0; rep(i, 1, n){ if(valid[i]){ p = i; break; } } if(p == 0){ no(); return 0; } vector

ans; ll q = sz(vec[p])-1; while(p != -1){ ans.push_back(P(vec[p][q].second, p)); ll np = vec[p][q].first.first, nq = vec[p][q].first.second; p = np, q = nq; } reverse(all(ans)); ans.push_back(P(Q+1, 0)); //outl(ans); yes(); rep(i, 0, sz(ans)-2){ rep(j, ans[i].first, ans[i+1].first-1) cout << ans[i].second << endl; } return 0; }