Prime Generator

t = input()
def isPrime(n):
     if n ==2:
          return True
     elif n<2 :
          return False
     else:
          for i in range(2,int(n**.5)+1):
               if not n%i:
                    return False
     return True
while t>0:
     n,m = map(int,raw_input().split())

     for i in range(n,m+1):
          if isPrime(i):
               print i
     t-= 1