#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define MAX 100000



ll prime[MAX+100];


void sieve()
{
    memset(prime,0, sizeof(prime));
    prime[0]=prime[1]=1;
    for(int i = 4; i < MAX; i+= 2)
    prime[i] = 1;
    for(int i = 3; i*i < MAX; i+=2)
    {
        if(prime[i]==0)
        {
            for(int j = i*i; j < MAX; j+=i)
            prime[j]=1;
        }
    }

}

int main()
{
    int t;
    scanf("%d",&t);
    sieve();
    while(t--){
        ll l , r;
        scanf("%lld%lld",&l,&r);
        for(int i = l ; i<= r ;i++){
            if(prime[i] == 0) printf("%d\n",i);
        }
    }
}