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
r4reejh:
20150523 17:59:28
Time limit issues in Python. 

Dushyant Singh:
20150519 09:44:00
@dr_strange  Yes, i did it using a simple property of prime numbers. 

britoboy:
20150519 01:13:22
this is very hard in Scala... What about time limits BY language? 

keerthi_1994:
20150518 13:35:24
what is NZEC? could any one help me out..n also what is MEM under analysis give fr our submission 

vivek keshore:
20150518 12:14:42
Finally done it. 

dr_strange:
20150517 20:45:40
is there a way to do it without sieve


daya:
20150517 11:44:02
showing segmentation error .how to remove. pls someone help me. 

deep:
20150513 21:26:36
my code shows correct output on ideone but here it shows wrong answer 

Avik Sarkar:
20150512 16:28:09
I took an array of a[n] but it says a is too large . what should i do ? 

Sheikh Ashiqul Islam:
20150511 19:57:33
This problem can be solved very easily without even using sieve :D 