Prime Generator

Peter wants to generate some prime numbers for his cryptosystem. Help him! Your task is to generate all prime numbers between two given numbers.

Input

Starts with the number of test cases $t(t\le 10)$ in a single line. In each of the next $t$ lines there are two numbers $m$ and $n(1\le m\le n\le 10^9,n-m\le 10^5)$.

Output

For every test case print all prime numbers $p$ such that $m\le p\le n$, one number per line, test cases separated by an empty line.

Examples