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
kannangce:
20160726 20:30:45
Getting EOF when reading a line in python.. Any clue.? 

tectonicfury:
20160726 10:59:12
[Nice comment by "octav" which i found useful while debugging:(i feel his comment should be made sticky)]


venkat73:
20160723 20:14:46
How do I read input for this problem in PHP? Can anyone help? 

Shidhu :
20160720 20:40:45
unbelievable !!!!


binari:
20160718 23:19:42
Use segmented sieve, as said by the comments.. but documents on the net may not tell it easily, so you have to understand and implement it yourself. It took me for 2 days (about 10 hours) to understand it. 

rishabh_1997:
20160713 08:53:35
Very nice question, first learnt sieve, Runtime Error.


wolf_01:
20160712 08:27:49
I used Rabinâ€“Miller primality test for solving this question in python 

Sumant Mann:
20160704 12:59:25
anybody solved this question in python? 

shahzin:
20160629 23:51:45
Use Segmented Sieve of Eratosthenes 

sriram8500:
20160627 18:49:06
thangaram:: You just use sqrt or log inloops that reduces the loop iteration greatly

Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL 6 