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

#define ll long long
const int N = 1e5;
vector <int> required_prime;

void prime_numbers(int n) {
	vector <bool> all_prime(n+1, true);
	all_prime[0] = all_prime[1] = false;
	for(int i = 2; i <= n; ++i) {
		if(all_prime[i]) {
			required_prime.push_back(i);
			for(int j = i * i; j <= n; j += i)
				all_prime[j] = false;
		}
	}
}

void prime(int m,int n) {
	if(m == 1) m++;
	vector<bool> p(n-m+1,true);
	prime_numbers(n);
	for(auto i : required_prime) {
		int sm = (m/i);
		if (sm <= 1) {
			sm = i + i;
		}
		else if (m % i) {
			sm = (sm * i) + i;
		}
		else {
			sm = (sm * i);
		}
		for(int j = sm; j <= n; j += i) {
			p[j-m] = false;
		}
	}
	for(int k = m; k <= n; ++k) {
		if(p[k-m] == true)
			cout << (k) << endl;
	}
	cout << endl;
}

int main() {
	 int t;
	 cin >> t;
	 while(t--) {
	 	int m,n;
	 	cin >> m >> n;
	 	prime(m,n);
	 }
	return 0;
}