#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
//using mint = modint1000000007;
//using mint = modint998244353;

vector<int> solve(int N, const vector<pair<int,int>>& v, int pos){
  int Q = v.size();

  vector<int> ret;
  
  rep(i,Q){
    int a = v[i].first;
    int b = v[i].second;

    if(pos != a && pos != b){
      ;
    }else{
      if(pos+1<=N && pos+1 != a && pos+1 != b){
        pos++;
      }
      else if(pos-1>=1 && pos-1 != a && pos-1 != b){
        pos--;
      }
      else{
        return vector<int>();
      }
    }

    ret.push_back(pos);
  }

  return ret;
}


int main(){
  int N, Q;
  cin >> N >> Q;
  vector<pair<int,int>> v(Q);
  rep(i,Q) cin >> v[i].first;
  rep(i,Q) cin >> v[i].second;

  if(v[0].first-1 >= 1){
    vector<int> ret = solve(N, v, v[0].first-1);
    if(ret.size() > 0){
      cout << "YES" << endl;
      cout << ret[0] << endl;
      rep(i,ret.size()) cout << ret[i] << endl;
      return 0;
    }
  }
  if(v[0].second-1 >= 1){
    vector<int> ret = solve(N, v, v[0].second-1);
    if(ret.size() > 0){
      cout << "YES" << endl;
      cout << ret[0] << endl;
      rep(i,ret.size()) cout << ret[i] << endl;
      return 0;
    }
  }
  if(v[0].first+1 <= N){
    vector<int> ret = solve(N, v, v[0].first+1);
    if(ret.size() > 0){
      cout << "YES" << endl;
      cout << ret[0] << endl;
      rep(i,ret.size()) cout << ret[i] << endl;
      return 0;
    }
  }
  if(v[0].second+1 <= N){
    vector<int> ret = solve(N, v, v[0].second+1);
    if(ret.size() > 0){
      cout << "YES" << endl;
      cout << ret[0] << endl;
      rep(i,ret.size()) cout << ret[i] << endl;
      return 0;
    }
  }

  cout << "NO" << endl;
  
  return 0;
}