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
p3arl_03:
20170213 13:42:25
Hi guys,


varun98:
20170212 18:51:56
is there any chat option on spoj platform ?


splashishkumar:
20170211 23:17:27
simple friend..no use of any sieve....think simply...get AC more simply


premmuvva:
20170209 20:51:04
bro if you get an error you try and try but don't go through any suggestions unless you are a beginner . it took me two days to do this code for which i was able to think about four totally new algorithms and new ways to percieve things hope you understand this 

rohit9934:
20170206 09:05:13
Time Limit Exceeded Last edit: 20170206 09:05:54 

akash_23:
20170205 15:01:53
good one! segmented sieve and AC! 

shubham2305:
20170205 10:13:22
didnt use seive or segmented seive


ranjita:
20170127 14:27:20
Rabin Miller is so nice


vietanisme:
20170126 05:57:14
Get TLE for 3  4 times. Spend 30 mins to debug. Realized I was chosing the wrong version of C++. AC in one go


shubhama003:
20170125 22:52:21
Segmented Sieve

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