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
manxmaniac:
20200808 09:18:11
segmented sieve makes it a charm 

asaati_7:
20200807 14:25:04
I've applied sieve, duration of the program with m=1 n=100001 10 times lasts for 0.56 s for me and I still get time limit exceeded. Any hint? (Python)


snorlexx:
20200730 06:26:05
My Program works flawlessly in NetBeans (JAVA) , still it's showing as WA , please help !! 

evanzo:
20200724 04:29:17
i am a beginner and i dont even know where to start from 

sohelr360:
20200721 06:50:09
Finaly ! i have managed to write code that works in 0.00 ms.


vishesh_jha17:
20200710 16:02:02
I have a error of Standard input is empty what I need to do? 

sajin_amin02:
20200701 07:11:14
segmented sieve is more interesting than the normal sieve 

n0va5trik3r:
20200627 10:46:30
I got the algorithm but I am getting Run Time Error in Python 3.7.


tyagikeshav30:
20200625 15:13:29
it took only 30 sec with very simple approach


ip_nandwani:
20200624 22:05:19
Please can anyone can provide me with the solution in c++, as my code always gets TLE(time limit exceeded) error. 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 