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, nm<=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 5Warning: 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
vishnu_:
20230131 15:16:46
<snip>


ayush_7901:
20221220 08:03:48
used segmented sieve nice problem 

tpoet:
20221216 10:27:08
where is the forum?


galaxie_729:
20221125 01:27:02
I used Elatonian prime sieve,but the the code runs out of runtime limit. 

aditi078:
20221026 16:08:50
i used segmented seive..still getting runtime exceeded:(


shivatmika98:
20221002 13:20:16
<snip>


aryan_2574:
20221001 09:30:56
To everyone who getting TLE, use segmented sieve 

laopig:
20220929 06:00:37
You can solve it , it is easy enough. 

vats_ayush:
20220921 17:21:15
what to do in case of m = n = 1


vats_ayush:
20220921 17:17:37
how to handle the case of m = n 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 