from sys import stdin
from math import sqrt, ceil

next(stdin) # skip unecessary line

def is_prime(number):
    initial_divider = sqrt(number)

    if number == 2:
      return True
    elif number % 2 == 0 or int(initial_divider) == initial_divider:
      return False

    for divider in range(ceil(initial_divider), 1, -1):
        if number % divider == 0:
            return False

    return True

for line in stdin:
    low, high = [int(x) for x in line.split(' ')]
    primes = [number for number
                     in range(max(low, 2), high+1)
                     if is_prime(number)]

    for prime in primes:
        print (prime)
    print('')