update version
def prime(n, m):

    list_prime = []

    for num in range (n, m + 1):

        if num < 2: continue # filter out numbers less than 2

        for i in range(2, num): # loop from 2 to num - 1      

            if num % i == 0: # if num is divisible by i, will break out this for-else loop

                break

        else: # this else block execute only if above for loop does not counter break statement

            list_prime.append(num) # add num to list_prime

        if len(list_prime) == 5: 

            break

    return list_prime 
N = int(input())

M = int(input())

print(prime(N, M))