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
aman9d:
20171208 15:45:36
TLE what to do 

neelaksh_07:
20171201 20:17:41
time limit exceeded..what to do


marcel_39:
20171127 13:49:42
Anyone figured out this runtime error? same problem here


daddythicc:
20171121 21:33:13
my answer is correct but it says ts wrong..... 

ajay_raj_:
20171120 15:10:28
I used command line and my code executed well... Here i get runtime error. 

kiju12:
20171116 07:35:45
i dont understand.. in the simulator i am getting the correct answer. but when i submit it, some problem is coming.. 

sdbhavsar:
20171115 19:01:12
my code is running fine on codeblocks IDE but it shows me time limit exceeded. What is optimized method for this?


prini17:
20171108 23:10:34
for prime generator result on idone is in 0.01s 27616KB , showing time limit exceed after submission?? 

coding_lover:
20171108 02:37:20
where can I see my submitted code?


milkyywayy:
20171102 08:54:33
limit time. Last edit: 20171102 08:55:15 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 