from collections import deque

N,M = map(int,input().split())
a = list(map(int,input().split()))
a = [a[i]-1 for i in range(N)]

for i in range(N-2):
    if a[i]==a[i+1] or a[i]==a[i+2] or a[i+1]==a[i+2]:
        exit(print("No"))

edge = [[] for i in range(M)]
deg = [0 for i in range(M)]
for i in range(N-1):
    u,v = a[i],a[i+1]
    if i%2==0:
        edge[v].append(u)
        deg[u] += 1
    else:
        edge[u].append(v)
        deg[v] += 1

deq = deque([v for v in range(M) if deg[v]==0])
X = [-1 for i in range(M)]
val = 1
while deq:
    v = deq.popleft()
    X[v] = val
    val += 1
    for nv in edge[v]:
        deg[nv] -= 1
        if deg[nv]==0:
            deq.append(nv)

if -1 not in X:
    print("Yes")
    print(*X)
    exit()

edge = [[] for i in range(M)]
deg = [0 for i in range(M)]
for i in range(N-1):
    u,v = a[i],a[i+1]
    if i%2==1:
        edge[v].append(u)
        deg[u] += 1
    else:
        edge[u].append(v)
        deg[v] += 1

deq = deque([v for v in range(M) if deg[v]==0])
X = [-1 for i in range(M)]
val = 1
while deq:
    v = deq.popleft()
    X[v] = val
    val += 1
    for nv in edge[v]:
        deg[nv] -= 1
        if deg[nv]==0:
            deq.append(nv)


if -1 not in X:
    print("Yes")
    print(*X)
    exit()

print("No")