from heapq import *

n, k = map(int, input().split())
A = list(map(int, input().split()))
hq = [-a for a in A[::-1]]
se = set(A)
row = 0
bef = 1 << 60
while hq:
    a = -heappop(hq)
    if a == 1:
        print("No")
        exit()
    if a <= 0:
        break
    if a == bef - 1:
        row += 1
        if row == 6:
            print("No")
            exit()
    else:
        row = 1
    bef = a
    if a - 1 in se:
        x = a - 4
        if x not in se:
            se.add(x)
            heappush(hq, -x)
    if a - 3 in se:
        x = a - 5
        if x not in se:
            se.add(x)
            heappush(hq, -x)
    if a - 5 in se:
        x = a - 6
        if x not in se:
            se.add(x)
            heappush(hq, -x)
    if a + 1 in se:
        x = a - 3
        if x not in se:
            se.add(x)
            heappush(hq, -x)
    if a + 3 in se:
        x = a - 2
        if x not in se:
            se.add(x)
            heappush(hq, -x)
    if a + 5 in se:
        x = a - 1
        if x not in se:
            se.add(x)
            heappush(hq, -x)
print("Yes")