#include <bits/stdc++.h>

using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

class rep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr usize operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr rep(const usize first, const usize last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

class revrep {
    struct Iter {
        usize itr;
        constexpr Iter(const usize pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { --itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr usize operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr revrep(const usize first, const usize last) noexcept
        : first(last - 1), last(std::min(first, last) - 1) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

template <class T> using Vec = std::vector<T>;

void concat(Vec<std::pair<usize, usize>>& vec) {
    Vec<std::pair<usize, usize>> ret;
    ret.push_back(vec.front());
    for (const auto i : rep(1, vec.size())) {
        const auto [l, r] = vec[i];
        if (l <= ret.back().second) {
            ret.back().second = r;
        } else {
            ret.emplace_back(l, r);
        }
    }
    vec = std::move(ret);
}

void del(Vec<std::pair<usize, usize>>& vec, const usize pos) {
    Vec<std::pair<usize, usize>> ret;
    for (const auto [l, r] : vec) {
        if (l <= pos and pos < r) {
            if (l != pos) {
                ret.emplace_back(l, pos);
            }
            if (pos + 1 != r) {
                ret.emplace_back(pos + 1, r);
            }
        } else {
            ret.emplace_back(l, r);
        }
    }
    vec = std::move(ret);
}

void D_main() {
    usize N, Q;
    std::cin >> N >> Q;
    Vec<usize> A(Q), B(Q);
    for (auto& x : A) {
        std::cin >> x;
        x -= 1;
    }
    for (auto& x : B) {
        std::cin >> x;
        x -= 1;
    }
    Vec<Vec<std::pair<usize, usize>>> vec(Q + 1);
    vec[0].emplace_back(0, N);
    for (const auto i : rep(0, Q)) {
        for (const auto [l, r] : vec[i]) {
            vec[i + 1].emplace_back((l == 0 ? 0 : l - 1), (r == N ? N : r + 1));
        }
        concat(vec[i + 1]);
        del(vec[i + 1], A[i]);
        del(vec[i + 1], B[i]);
        if (vec[i + 1].empty()) {
            std::cout << "NO\n";
            return;
        }
    }
    std::cout << "YES\n";
    Vec<usize> pos;
    pos.push_back(vec[Q].front().first);
    for (const auto i : revrep(0, Q)) {
        bool f = false;
        for (const auto [l, r] : vec[i]) {
            if (pos.back() + 1 == l) {
                pos.push_back(l);
                f = true;
            } else if (r == pos.back()) {
                pos.push_back(r - 1);
                f = true;
            } else if (l <= pos.back() and pos.back() < r) {
                pos.push_back(pos.back());
                f = true;
            }
            if (f) {
                break;
            }
        }
    }
    std::reverse(pos.begin(), pos.end());
    for (const auto x : pos) {
        std::cout << x + 1 << '\n';
    }
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    D_main();
    return 0;
}