#include <iostream>
#include <cmath>

const int MAX = 20;

bool arrStorePrimes[MAX] = { 0 };

void ShowPrimes(int min, int max);

bool isPrime(int n)
{
    if(n == 1)
		return false;

	if(n < MAX && arrStorePrimes[n] != 0)
	{
		return true;
	}

        int sq = sqrt(n);

	for(int i = 3; i <= sq; i += 2)
	{
		if(n % i == 0)
			return false;
	}

	if(n < MAX)
		arrStorePrimes[n] = 1;
	
	return true;
}
int main()
{
	using std::cin;
	int num;
	cin >> num;
	int min, max;
	
	while(num)
	{
		cin >> min;
		cin >> max;
		ShowPrimes(min, max);
		num--;
	}
	return 0;
}

void ShowPrimes(int min, int max)
{
	if( min % 2 == 0 )
		++min;
	for(int i = min; i <= max; i += 2)
	{
		if(isPrime(i))
			std::cout << i << std::endl;
	}
}