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.Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel Pentium G860 3GHz) 
Languages:  All except: NODEJS PERL 6 SCM chicken 
hide comments
hacker:
20150420 22:27:24
primality test is the learning factor in this question 

Coder:
20150408 19:13:15
NZEC in java help me 

Asheesh Pathak:
20150407 21:56:53
Real Fun... Learnt many new things :) 

Nikhil:
20150404 07:31:51
The "Primality test" is the easiest method of solve this problem. 

man:
20150330 20:17:22
prime generator problem successfully compiled and run on my compiler codeblocks but here it shows time limit exceeded...why?? 

im9:
20150329 18:36:11
I am facing wrong answer although its giving right answers on the cases I have tried


anonymous:
20150328 18:09:27
I don't understand why my submition doen't pass spoj's test.


anup30:
20150328 12:07:01
0.24 sec. Last edit: 20150328 12:41:49 

dsr:
20150326 06:00:51
OMG, this is tough... Last edit: 20150326 06:59:00 

ranieri:
20150325 04:52:17
Well, even though the algorithm takes less than .6s on a modest low power notebook, it seems to take more than 6 seconds to complete at the judge. I will be skipping it as there seems to be some problem with the judge.
