PRIME1 - 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

The 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.

Output

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

Example

Input:
2
1 10
3 5

Output:
2
3
5
7

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

Information

After cluster change, please consider PRINT as a more challenging problem.

hide comments
dev1604: 2017-03-29 19:03:44

Time limit exceed error is generally for the problem of the code going in infinite loop.

soumya_dip: 2017-03-29 08:23:21

why I am getting time limit exceeded?

anurag_tangri: 2017-03-28 14:26:19

my 50th:)

asvs_kartheek: 2017-03-23 11:36:39

My code is running good in ideone but here it is showing time limit exceeded

amandal799: 2017-03-22 13:16:08

keep track of prime numbers up to sqrt(1e9) and apply sieve simply

Last edit: 2017-03-22 13:16:38
abidzz178: 2017-03-21 14:35:05

what things do i need to keep in mind to save myself getting run time error ?

mhto: 2017-03-17 19:39:55

finally.. after 9 attempts :D

mosta7il_: 2017-03-15 15:30:08

an easy AC

nitisha1: 2017-03-15 01:45:45

After so much try........... Finally AC!!!

tekfyl: 2017-03-11 14:51:59


Last edit: 2017-03-11 15:50:54

Added by:Adam Dzedzej
Date:2004-05-01
Time limit:6s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS PERL6