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
Rafi Ahmad:
20160212 11:09:10
why its show time limit exceeded


navdeep_singh:
20160210 19:14:56
what is "time limit exceeded" error.


rahulvaidya20:
20160208 20:13:51
Getting SIGSEGV error.....but works fine on any compiler including ideone 

dharmbhusan_0:
20160206 07:09:51
where am i rong when i am writting prime generator program on gcc then it is ok but when i am writting on spoj then time limit exceeded shown plz help me


dkumarsingh:
20160201 19:16:50
a silly mistake got me 2 WA... a nice problem....


abd_alrhman:
20160131 12:27:00
how i can show the output of my wrong submission 

ulti72:
20160131 08:33:38
What does for every test case means 

aktech:
20160129 19:44:31
This may help: http://iamit.in/blog/SpojProblemSmallFactorialsFCTRL2ExplanationandSolution/ 

enessetere:
20160129 09:23:06
is there any chance to see where and what "wrong answer" appears? 

sukhadspoj:
20160123 14:33:10
getting sigsegv again and again but code workking fine with ideone 
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 