#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001

int main(){
	
	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<set<int>> S(Q+1);
	
	rep(i,N){
		S[0].insert(i);
	}
	
	
	rep(i,Q){
		while(S[i].size()>8){
			S[i].erase(S[i].begin());
		}
		for(auto a:S[i]){
			S[i+1].insert(max(0,a-1));
			S[i+1].insert(a);
			S[i+1].insert(min(N-1,a+1));
		}
		
		S[i+1].erase(A[i]);
		S[i+1].erase(B[i]);
		if(S[i+1].size()==0){
			cout<<"NO"<<endl;
			return 0;
		}
	}
	
	cout<<"YES"<<endl;
	
	vector<int> ans;
	for(int i=Q;i>=0;i--){
		if(i==Q){
			ans.push_back(*(S[i].begin()));
		}
		else{
			int c = ans.back();
			for(int j=-1;j<=1;j++){
				if(S[i].count(c+j)){
					ans.push_back(c+j);
					break;
				}
			}
			
		}
	}
	
	reverse(ans.begin(),ans.end());
	
	rep(i,ans.size()){
		cout<<ans[i]+1<<endl;
	}
		
	
    return 0;
}