#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;
map<int, int> pr[100010];
int main()
{
    int n, q; cin>>n>>q;
	int a[100010], b[100010];
	for(int i=0; i<q; i++){
		cin>>a[i]; a[i]--;
	}
	for(int i=0; i<q; i++){
		cin>>b[i]; b[i]--;
	}
    for(int i=-20; i<=20; i++){
        int x=a[0]+i;
        if(x>=0 && x<n) pr[0][x]=0;
    }
    for(int i=0; i<q; i++){
        for(auto p:pr[i]){
            int x=p.first;
            for(int k=-1; k<=1; k++){
                int y=x+k;
                if(y<0 || y>=n) continue;
                int d1=abs(y-a[i]), d2=abs(y-b[i]);
                if(d1>0 && d2>0 && (d1<=20 || d2<=20)){
                    pr[i+1][y]=x;
                }
            }
        }
    }
    if(pr[q].empty()){
        mt19937 mt(334);
        uniform_int_distribution rndn(0, n-1);
        {
            for(int l=0; l<50; l++){
                int s=rndn(mt);
                vector<int> ans;
                bool dame=0;
                ans.push_back(s+1);
                for(int i=0; i<q; i++){
                    vector<int> v;
                    if(s-1>=0 && a[i]!=s-1 && b[i]!=s-1){
                        v.push_back(s-1);
                    }
                    if(a[i]!=s && b[i]!=s){
                        v.push_back(s);
                    }
                    if(s+1<n && a[i]!=s+1 && b[i]!=s+1){
                        v.push_back(s+1);
                    }
                    if(v.empty()){
                        dame=1;break;
                    }
                    ans.push_back(v[mt()%((int)v.size())]+1);
                }
                if(!dame){
                    cout<<"YES"<<endl;
                    for(auto x:ans) cout<<x<<endl;
                    return 0;
                }
            }
            cout<<"NO"<<endl;
            return 0;
        }
        return 0;
    }
    cout<<"YES"<<endl;
    int x=pr[q].begin()->first;
    vector<int> ans;
    for(int i=q; i>=0; i--){
        ans.push_back(x);
        x=pr[i][x];
    }
    reverse(ans.begin(), ans.end());
    for(auto y:ans) cout<<y+1<<endl;
    return 0;
}