import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

def Compress(lst):
    decomp=sorted(list(set(lst)))
    comp={x:i for i,x in enumerate(decomp)}
    return comp,decomp

N,Q=map(int,readline().split())
A=list(map(int,readline().split()))
B=list(map(int,readline().split()))
for q in range(Q):
    A[q]-=1
    B[q]-=1
    if A[q]>B[q]:
        A[q],B[q]=B[q],A[q]
dp=[[] for q in range(Q+1)]
for q in range(1,Q+1):
    lst=[A[q-1],A[q-1]+1,B[q-1],B[q-1]+1]
    for l,r in dp[q-1]:
        if 0<l:
            l+=1
        if r<N:
            r-=1
        if l<r:
            lst.append(l)
            lst.append(r)
    comp,decomp=Compress(lst)
    le=len(comp)
    bl=[1]*(le-1)
    for l,r in dp[q-1]:
        if 0<l:
            l+=1
        if r<N:
            r-=1
        if l<r:
            for i in range(comp[l],comp[r]):
                bl[i]=0
    for i in range(comp[A[q-1]],comp[A[q-1]+1]):
        bl[i]=0
    for i in range(comp[B[q-1]],comp[B[q-1]+1]):
        bl[i]=0
    L,R=[],[]
    if not bl[0]:
        L.append(0)
    for i in range(1,le-1):
        if bl[i-1] and not bl[i]:
            L.append(i)
        if not bl[i-1] and bl[i]:
            R.append(i)
    if not bl[le-2]:
        R.append(le-1)
    for l,r in zip(L,R):
        dp[q].append((decomp[l],decomp[r]))
if dp[Q]==[(0,N)]:
    print("NO")
    exit()

ans_lst=[]
l,r=dp[Q][0]
if l:
    x=l-1
else:
    x=r
ans_lst.append(x)
for q in range(Q-1,-1,-1):
    for x in (x-1,x,x+1):
        if 0<=x<N and not any(l<=x<r for l,r in dp[q]):
            ans_lst.append(x)
            break
ans_lst=ans_lst[::-1]
print("YES")
print(*[x+1 for x in ans_lst],sep="\n")