611

#-*-coding:utf8;-*-
#qpy:3
#qpy:console

m, n = map(int, input().split())
prime = [True for i in range(n+1)]

prime[0] = prime[1] = False
flag = False

for i in range(n+1):
  if prime[i]:
    if i >= m:
      flag = True
      print(i)
    j = i*i
    while j <= n:
      prime[j] = False
      j+= i

if not flag:
  print("Absent")