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
atharva12345:
20191016 17:26:22
whats the way to solve this so that i dont get TLE?


eyenine:
20191011 17:56:05
IS sieve of Eratosthenes is necessary to solve this?


technorsh:
20191009 11:33:26
I have test for worst case, it is giving 4.139s but after submitting it's giving exceed time limit. 

orkhan_az:
20191002 05:33:17
Why it writing time limit ? I pass all self test by code it done succesfull


krishna_siva_:
20190929 07:37:07
@uri_12 I know right, tried it in Python 3, PyPy and C++, and only C++ worked. They really need to adjust their time limits. 

hetp111:
20190927 14:15:47
no need for segmented seive. 

bihari_kid:
20190925 15:12:27
apply segmented sieve algorithm


srinathsekar:
20190917 20:00:48
I'm getting TLE why?


carcomortesi:
20190916 23:08:39
Testing my code in my VS2017 and timing it I always obtain about 1516 millis. But here I always obtain TLE. What am I doing wrong? Is there any sample of input that could be realistic? 

coder_mukul:
20190908 20:51:17
Help my whole code is correct and but spoj declares it wrong. 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 