import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques,heapqueue
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc solve():int=
  var
    n = scan()
    k = scan()
    a = newseqwith(k,scan()).sorted(SortOrder.Descending)
    ngMath = initHeapQueue[int]()# goalに近いマスから埋めていくので、vを負にしていれる
    ng = initHashSet[int]()
  for v in a:
    ngMath.push(-v)
  while ngMath.len>0:
    var
      v = - ngMath.pop
    if v<0:
      break
    ng.incl(v)
    if v+5 in ng:
      ngMath.push(-(v-1))
    if v+3 in ng:
      ngMath.push(-(v-2))
    if v+1 in ng:
      ngMath.push(-(v-3))
  #echo ng
  if 1 in ng:
    echo "No"
  else:
    echo "Yes"


      

  
  
discard solve()