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
imharveer:
20181007 11:17:06
i am using sqrt(n) then also its giving me time exceeded may i know why?? 

gozubair:
20180928 13:09:46
Now my codes runs 0.01 second but i am getting run time error?? 

reclu:
20180928 12:54:05
See the input constraints!


gozubair:
20180928 06:20:38
My code still giving me tle plz guide me in python 

gozubair:
20180927 19:28:24
I am not finding python's solution yet 

karate_25:
20180924 01:21:10
I wanna know why i get a wrong answer , could I know how u test inputs , do u test it as a collection of input or every input separately ?!! 

julkas:
20180923 15:41:35
@kire85 I have tested sieveofatkin from geeksforgeeks on ideone.com with your modification for limit=10**6 (without printing primes) with PyPy. It's very slow  0.17s. My PyPy implementations of SE (sieve of Etatosthenes), OSE (odd sieve of Etatosthenes), SS (sieve of Sundaram) for limit=10**6 give 0.04s.


kire85:
20180923 09:53:33
in c++ i get a 0.4 solution with first sieveing the primes below 32000 (sqrt of 1 000 000 000) and then using those primes with modolus to check if each number is prime in the range for each testcase. I have coded the same solution i python but TLE. i used https://www.geeksforgeeks.org/sieveofatkin/ as sieve. The python code as a flaw. It is missing r =r+1 in the last while loop. I have pointed this out in the comments. 

marcobw1:
20180909 19:01:16
Use complexity O(n^2) , check up division until squared(n), it shall work 

y17prashant:
20180909 09:05:55
using seive will cause lot of memory for very large numbers . Just read the question we have to only output the prime numbers simply go by traditional sqrt(n) method or use segmented seive.

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