\nPeter wants to generate some prime numbers for his cryptosystem. Help him!\nYour task is to generate all prime numbers between two given numbers!\n

\n

Input

\n

\nThe input begins with the number t of test cases in a single line (t<=10). In each of the next t lines there are two numbers m and n (1 <= m <= n <= 1000000000, n-m<=100000) separated by a space.\n

\n

Output

\n

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

\n

Example

\n

Input:\n2\n1 10\n3 5\n\nOutput:\n2\n3\n5\n7\n\n3\n5\n

\nWarning: large Input/Output data, be careful with certain languages (though most should be OK if the algorithm is well designed)\n\n

Information

\nAfter cluster change, please consider

统计

递交统计

Prime Generator

信息

状态

开发

支持

还没有账户？

登录