H

from math import sqrt

def is_prime(n):
    if n < 2:
        return False
    if n == 2:
        return True
    limit = sqrt(n)
    i = 2
    while i <= limit:
        if n % i == 0:
            return False
        i += 1
    return True

K, N = map(int, input().split())
lst = []
for i in range(K, N + 1):
    if is_prime(i):
            if is_prime(2*i + 1):
                lst.append(i)
if len(lst) == 0:
    print(0)
    exit(0)
print(*lst)