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
ankish__99:
20200312 07:36:04
Last edit: 20200312 10:48:55 

lucifer1004:
20200310 11:16:15
@sobrevivente, the first line is t (number of test cases). 

sobrevivente:
20200308 21:26:23
I don't understand how mine doesn't work:


mohit827:
20200308 03:39:21
I use sieve of Eratosthenes in python but it still gave time limit exceeded. What can i do 

hoangbonduy123:
20200221 08:36:09
wow the time limit is large 

hoangbonduy123:
20200221 08:35:41
Easy AC 

nguyen ngoc son:
20200221 02:13:12
q 

shafaet:
20200219 02:51:53
segment sieve or bitwise sieve will be the best choice for beginner 

dileep32:
20200217 18:38:37
yes, time limit is constant for all languages , i used sqrt and odd number method got accepted. 

asimmahmood88:
20200213 05:45:55
my code is running fine on ideone but here my submission isnt being accepted. I am getting "runtime error (NZEC)". Can someone help me please 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 