#include
using namespace std;
void primeSieve(int *p,int n){
p[0]=p[1]=0;
p[2]=1;
/// let us mark all odd numbers as prime
for(int i=3;i<=n;i+=2){
p[i]=1;
}
///sieve logic to mark non primes
for(int i=3;i<=n;i+=2){
if(p[i]){
for(int j=i*i;j<=n;j+=i){
p[j]=0;
}
}
}
}
int main()
{
int t;
cin>>t;
while(t–){
int N=100000;
int p[N+1]={0};
int start,end;
cin>>start>>end;
primeSieve(p,end);
for(int i=start;i<=end;i++){
if(p[i]){
cout<<i<<endl;
}
}
cout<<endl;
}
return 0;
}