#include<stdio.h>
#include<vector>
#include<algorithm>
#define MAX 100000
using namespace std;
vector<long long> pri;
void preprocess()
{
long long arr[MAX];
for(long long i=0; i<MAX; i++)
arr[i]=1;
arr[0]=arr[1]=0;
for(long long i=2;i<MAX;i++)
{
if(arr[i]==1)
{
pri.push_back(i);
for(long long j=i*i;j<MAX;j=j+i)
arr[j]=0;
}
}
}
void result(int low, int high)
{
int len=high-low+1;
int arr[len];
for(int i=0;i<len;i++)
arr[i]=1;
if(low==1)
arr[0]=0;
for(int i=0;pri[i]*pri[i]<=high;i++)
{
int temp=(low/pri[i])*pri[i];
if(temp<low)
temp+=pri[i];
for(int j=temp-low;j<len;j+=pri[i])
if(j!=pri[i])
arr[j]=0;
}
for(int i=0;i<len;i++)
if(arr[i])
printf("%d\n",i+low);
}
int main()
{
int test, a ,b;
preprocess();
scanf("%d",&test);
while(test--)
{
scanf("%d%d",&a,&b);
result(a,b);
printf("\n");
}
return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8dmVjdG9yPgojaW5jbHVkZTxhbGdvcml0aG0+CiNkZWZpbmUgTUFYIDEwMDAwMAp1c2luZyBuYW1lc3BhY2Ugc3RkOwp2ZWN0b3I8bG9uZyBsb25nPiBwcmk7CnZvaWQgcHJlcHJvY2VzcygpCnsKCWxvbmcgbG9uZyBhcnJbTUFYXTsKCWZvcihsb25nIGxvbmcgaT0wOyBpPE1BWDsgaSsrKQoJCWFycltpXT0xOwoJYXJyWzBdPWFyclsxXT0wOwoJCglmb3IobG9uZyBsb25nIGk9MjtpPE1BWDtpKyspCgl7CgkJCgkJaWYoYXJyW2ldPT0xKQoJCXsKCQkJCgkJCXByaS5wdXNoX2JhY2soaSk7CgkJCWZvcihsb25nIGxvbmcgaj1pKmk7ajxNQVg7aj1qK2kpCgkJCQlhcnJbal09MDsKCQl9Cgl9Cn0Kdm9pZCByZXN1bHQoaW50IGxvdywgaW50IGhpZ2gpCnsKCWludCBsZW49aGlnaC1sb3crMTsKCWludCBhcnJbbGVuXTsKCWZvcihpbnQgaT0wO2k8bGVuO2krKykKCQlhcnJbaV09MTsKCWlmKGxvdz09MSkKCQlhcnJbMF09MDsKCWZvcihpbnQgaT0wO3ByaVtpXSpwcmlbaV08PWhpZ2g7aSsrKQoJewoJCWludCB0ZW1wPShsb3cvcHJpW2ldKSpwcmlbaV07CgkJaWYodGVtcDxsb3cpCgkJCXRlbXArPXByaVtpXTsKCQlmb3IoaW50IGo9dGVtcC1sb3c7ajxsZW47ais9cHJpW2ldKQoJCQkJaWYoaiE9cHJpW2ldKQoJCQkJCWFycltqXT0wOwoJfQoJCglmb3IoaW50IGk9MDtpPGxlbjtpKyspCgkJaWYoYXJyW2ldKQoJCQlwcmludGYoIiVkXG4iLGkrbG93KTsKfQppbnQgbWFpbigpCnsKCWludCB0ZXN0LCBhICxiOwoJcHJlcHJvY2VzcygpOwoJc2NhbmYoIiVkIiwmdGVzdCk7Cgl3aGlsZSh0ZXN0LS0pCgl7CgkJc2NhbmYoIiVkJWQiLCZhLCZiKTsKCQlyZXN1bHQoYSxiKTsKCQlwcmludGYoIlxuIik7Cgl9CglyZXR1cm4gMDsKfQ==