#include<iostream>
#include<algorithm>
#define MAX 320
 
using namespace std;
 
unsigned int prime[MAX];
bool check_prime[MAX]={0};
unsigned int p= 0;
 
void find_prime()
{	
	for(unsigned int i= 2; i<=MAX; i++)
	{
		if(check_prime[i]==0)
		{
			prime[p]= i;
			p++;
			cout<<p<<" ";
			for(unsigned int j= i*i; j<=MAX; j=j+i)
				check_prime[j]= 1;
		}
	}
}
 
int main()
{
	find_prime();
	int t;
	cin>>t;
 
	for(int i=0; i<t; i++)
	{
		int m, n;
		cin>>m>>n;
		for(int j= m; j<=n; j++)
		{
			int ctr= 0;
			for(int k= 0; prime[k]*prime[k]<= j; k++)
			{
				if(j%prime[k]==0)
				{
					ctr++;
					break;
				}
			}
			if(ctr== 0)
				cout<<j<<endl;
		}
	}
	return 0;
}

I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPGFsZ29yaXRobT4KI2RlZmluZSBNQVggMzIwCgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKdW5zaWduZWQgaW50IHByaW1lW01BWF07CmJvb2wgY2hlY2tfcHJpbWVbTUFYXT17MH07CnVuc2lnbmVkIGludCBwPSAwOwoKdm9pZCBmaW5kX3ByaW1lKCkKewkKCWZvcih1bnNpZ25lZCBpbnQgaT0gMjsgaTw9TUFYOyBpKyspCgl7CgkJaWYoY2hlY2tfcHJpbWVbaV09PTApCgkJewoJCQlwcmltZVtwXT0gaTsKCQkJcCsrOwoJCQljb3V0PDxwPDwiICI7CgkJCWZvcih1bnNpZ25lZCBpbnQgaj0gaSppOyBqPD1NQVg7IGo9aitpKQoJCQkJY2hlY2tfcHJpbWVbal09IDE7CgkJfQoJfQp9CgppbnQgbWFpbigpCnsKCWZpbmRfcHJpbWUoKTsKCWludCB0OwoJY2luPj50OwoJCglmb3IoaW50IGk9MDsgaTx0OyBpKyspCgl7CgkJaW50IG0sIG47CgkJY2luPj5tPj5uOwoJCWZvcihpbnQgaj0gbTsgajw9bjsgaisrKQoJCXsKCQkJaW50IGN0cj0gMDsKCQkJZm9yKGludCBrPSAwOyBwcmltZVtrXSpwcmltZVtrXTw9IGo7IGsrKykKCQkJewoJCQkJaWYoaiVwcmltZVtrXT09MCkKCQkJCXsKCQkJCQljdHIrKzsKCQkJCQlicmVhazsKCQkJCX0KCQkJfQoJCQlpZihjdHI9PSAwKQoJCQkJY291dDw8ajw8ZW5kbDsKCQl9Cgl9CglyZXR1cm4gMDsKfQ==