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
mckay93:
20161204 15:21:42
if (time limit exceeded) your program is running not enough fast. test your program with max possible values


abhishek1singh:
20161203 21:08:38
i am finding runntime error how can i find it


Wahyu Hendro Hartono:
20161128 01:09:16
reduce checking if you got TLE. you don't have to check for all divider. think about it. minimalize it Last edit: 20161128 01:10:20 

mckay93:
20161127 16:35:42
i also have a problem with "time limit exceed". i dont know what wrong 

lrx_22:
20161126 16:17:20
My solution got wrong answer although my output is correct!


droidbait:
20161125 16:17:03
time limit exceed and don't know what to now.I solved it but... 

krish32:
20161120 21:53:08
What is limited time exceed i have same problem any body know what is this??? 

muso2002_2014:
20161119 05:34:41
I WANT TO SOLVE IT HELP ME PLEASE! 

juancarlovieri:
20161112 05:20:27
how to do this thing


soodan:
20161111 12:06:01
use segmented sieve for best results and modify sieve according to requirements 
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 