#include<bits/stdc++.h>
using namespace std;
#define ll long long int
ll lim=1000000;
ll p[1000000];

void primeSieve()
{
  ll i,j;
  //memset(p,0,sizeof(p));
  for(i=0;i<lim;i++)
  p[i]=0;
  p[2]=1;
  for(i=3;i<lim;i+=2)
  p[i]=1;
  
  for(i=3;i<lim;i+=2)
  {
    if(p[i])
    {
      for(j=i*i;j<lim;j+=i)
      {
        p[j]=0;
      }
    }
  }
}

void solve(ll m,ll n)
{
	//cout<<m<<" "<<n;
	ll di=n-m+1;
  ll i,j,b[di+1];
  for(i=0;i<di;i++)
  b[i]=1;
  
  for(j=m;j<=n;j++)
  {
        if(j==2)
        continue;
        if(j%2==0)
        {
        	b[j-m]=0;
        }
  }
  
  for(i=3;i*i<=n;i+=2)
  {
  	if(p[i])
  	{
  		for(j=m;j<=n;j++)
      {
      		if(j==i)
    		  continue;
	        if(j%i==0)
	        {
	        	b[j-m]=0;
	        	//cout<<i<<" "<<j<<"\n";
	        }
      }
  	}
      
  }
  if(m==1)
  {
    b[0]=0;
  }
  
  for(i=m;i<=n;i++)
  {
    if(b[i-m]==1)
    {
      cout<<i<<"\n";
    }
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll t,m,n,i,j;
  cin>>t;
  primeSieve();
  while(t--)
  {
    cin>>m>>n;
    solve(m,n);
    cout<<"\n";
  }
  return 0;
}