В начальный момент времени Снарк находится в точке прямой с целой неотрицательной координатой X

def get_s_diff(max_rng: list[int, ...], cur_rng: list[int, ...], s: int) -> float:
    return max_rng[-1] - cur_rng[0] / s if max_rng else float('inf')
 
 
def rng_is_legal(max_rng: list[int, ...], cur_rng: list[int, ...], current_x: int, s: int) -> bool:
    return len(cur_rng) != 1 and len(cur_rng) - len(max_rng) < get_s_diff(max_rng, cur_rng, s) \
            and cur_rng and cur_rng[0] - 1 != current_x and cur_rng[0] - 1 != 0
 
 
def choose_best_place_for_bun(current_x: int, s: int, traps: list[int, ...]) -> int | bool:
    traps.sort()
    max_rng = []
    cur_rng = []
 
    for i in range(len(traps) - 1):
        if traps[i + 1] - traps[i] == 1:
            if not cur_rng:
                cur_rng.append(traps[i])
            cur_rng.append(traps[i + 1])
        else:
            if rng_is_legal(max_rng, cur_rng, current_x, s):
                max_rng = cur_rng[:]
            cur_rng = []
 
    if not max_rng:
        if current_x == 1:
            return False
        if rng_is_legal(max_rng, cur_rng, current_x, s):
            max_rng = cur_rng[:]
        else:
            max_rng = [2]
 
    return max_rng[0] - 1
 
 
def main() -> None:
    x, s, n = map(int, input().split())
    traps = [int(input()) for _ in range(n)]
 
    while x != 0:
        possible_moves = []
 
        for y in range(x - 1, -1, -1):
            if abs(x - y) <= s and y not in traps:
                possible_moves.append(y)
 
        if not possible_moves:
            print('YES')
            break
        else:
            x = possible_moves[-1]
        ins = choose_best_place_for_bun(x, s, traps)
        if ins is not False:
            traps.append(ins)
    else:
        print('NO')
 
 
if __name__ == '__main__':
    main()