#include <iostream>
#include <vector>
#include <bitset>

using namespace std;

int main() {
    int N, Q;
    cin >> N >> Q;

    vector<int> A(Q);
    vector<int> B(Q);
    for (int q = 0; q < Q; ++q) {
        cin >> A[q];
        A[q] -= 1;
    }
    for (int q = 0; q < Q; ++q) {
        cin >> B[q];
        B[q] -= 1;
    }

    vector<bitset<100000>> dp(Q + 1);
    dp[0] = (1 << N) - 1;
    for (int q = 1; q <= Q; ++q) {
        dp[q] = dp[q - 1] >> 1 | dp[q - 1] | dp[q - 1] << 1;
        dp[q] &= ~(1 << N | 1 << A[q - 1] | 1 << B[q - 1]);
    }

    if (dp[Q].any()) {
        cout << "YES" << endl;
        int x;
        for (x = 0; x < N; ++x) {
            if (dp[Q][x]) {
                break;
            }
        }
        vector<int> ans_lst;
        ans_lst.push_back(x);
        for (int q = Q - 1; q >= 0; --q) {
            if (x - 1 >= 0 && dp[q][x - 1]) {
                x -= 1;
            } else if (x + 1 < N && dp[q][x + 1]) {
                x += 1;
            }
            ans_lst.push_back(x);
        }
        for (int i = ans_lst.size() - 1; i >= 0; --i) {
            cout << ans_lst[i] + 1 << endl;
        }
    } else {
        cout << "NO" << endl;
    }

    return 0;
}