#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, Q;
    cin >> N >> Q;
    vector<int> A(Q), B(Q);
    for (auto&& a : A) {
        cin >> a;
        a--;
    }
    for (auto&& b : B) {
        cin >> b;
        b--;
    }
    vector<bitset<100000>> maine(Q + 1);
    for (int i = 0; i < N; i++) {
        maine[0][i] = 1;
    }
    for (int i = 0; i < Q; i++) {
        maine[i + 1] = (maine[i] << 1) | (maine[i] >> 1);
        maine[i + 1][N] = 0;
        if (maine[i][0])
            maine[i + 1][0] = 1;
        if (maine[i][N - 1])
            maine[i + 1][N - 1] = 1;
        maine[i + 1][A[i]] = 0;
        maine[i + 1][B[i]] = 0;
    }
    if (maine[Q].count() == 0)
        cout << "NO" << endl;
    else {
        cout << "YES" << endl;
        vector<int> ans(Q + 1);
        int book;
        for (int i = 0; i < N; i++) {
            if (maine[Q][i]) {
                book = i;
                break;
            }
        }
        ans[Q] = book;
        for (int i = Q - 1; i >= 0; i--) {
            if (book > 0 && maine[i][book - 1])
                book--;
            else if (book < N - 1 && maine[i][book + 1])
                book++;
            ans[i] = book;
        }
        for (auto&& a : ans) {
            cout << a + 1 << endl;
        }
    }
}