#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q; cin >> n >> q;
	vector<int>a(q), b(q);
	rep(i, q) { cin >> a[i]; a[i]--; }
	rep(i, q) { cin >> b[i]; b[i]--; }
	vector<int>l(q + 1), r(q + 1);
	l[q] = 0; r[q] = n - 1;
	rrep(i, q) {
		if (a[i] > b[i]) swap(a[i], b[i]);
		int nl = max(0, l[i + 1] - 1);
		int nr = min(n - 1, r[i + 1] + 1);
		if ((nl == a[i]) || (nl == b[i])) {
			nl++;
			if (nl == b[i]) {
				nl++;
			}
		}
		if ((nr == a[i]) || (nr == b[i])) {
			nr--;
			if (nr == a[i]) {
				nr--;
			}
		}
		if (nl > nr) {
			cout << "NO" << endl;
			return 0;
		}
		//cout << nl << " " << nr << endl;
		l[i] = nl;
		r[i] = nr;
	}
	cout << "YES" << endl;
	int pos = l[0];
	cout << pos + 1 << endl;
	rep(i, q) {
		if (pos < l[i]) pos++;
		else if (r[i] < pos)pos--;
		else if (a[i] == pos || b[i] == pos) {
			if ((pos + 1) <= r[i] && (a[i] != (pos + 1) && b[i] != (pos + 1))) pos++;
			else pos--;
		}
		cout << pos + 1 << endl;
	}
	return 0;
}