#include<iostream>
using namespace std;

bool isPrime(int x) {
    int dzielnik = 1;

    if (x == 0 || x == 1) {
        return false;
    }
    else {
        for (int i = 2; i < x; i++) {
            if (x%i == 0) {
                dzielnik++;
            }
        }
    }
    if (dzielnik > 1) {
        return false;
    }
    else return true;
}

int main() {
    int t; // <= 10 - number of cases (lines)
    int m, n; // 1 <= m <= n <= 1000000000, n - m <= 100000; separated by space
    int p; // prime number to print separated by endl; m <= p <= n

    cin >> t;

    for (int i = 0; i < t; i++) {
        cin >> m >> n;

        int range = n - m;
        for (int i = 0; i <= range; i++) {
            p = m + i;
            if (isPrime(p)) {
                cout << p << endl;
            }
        }
        cout << endl;
    }
    return 0;
}