#include <iostream>
#include <math.h>
#include <deque>
#include <sstream>

bool is_prime(const int &number)
{
    if (number < 2)
        return false;
        
    int j = sqrt(number);
    for (int i = 2; i < j; i++)
        if (number%i == 0)
            return false;

    return true;
}

int main()
{
    std::deque<int> outputLimits;
    int testsDone = 0;

    int numTests;
    std::cin >> numTests;

    while (testsDone <= numTests)
    {
       // std::string test;
        int first, second;

        //getline(std::cin, test);
        //std::stringstream ss(test);
        std::cin >> first >> second;

        outputLimits.push_back(first);
        outputLimits.push_back(second);

        ++testsDone;
    }

    while (!outputLimits.empty())
    {
        int start = outputLimits[0];
        int finish = outputLimits[1];
        while (start <= finish)
        {
            if (is_prime(start))
                std::cout << start << std::endl;
            ++start;
        }
        outputLimits.pop_front();
        outputLimits.pop_front();
        std::cout << std::endl;
    }
    return 0;
}