def find_primes(n):
    sup = n + 1
    prime = [True] * sup
    prime[0] = prime[1] = False
    count = 2
    for i in range(2, sup):
        if count == sup:
            break
        if not prime[i]:
            continue
        count += 1
        for j in range(i * i, sup, i):
            if prime[j]:
                prime[j] = False
                count += 1
    return prime


def find_super_primes(a, b):
    primes = find_primes(b - 2)
    super_primes = []
    for index in range(max(a, 3), b + 1):
        if index % 2 == 0 or primes[index - 2]:
            super_primes.append(index)
    return super_primes


a, b = map(int, input().split())
print(*find_super_primes(a, b), sep='\n')