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
mswarp:
20200620 12:48:08
Is it not possible to answer this question using C? My code keeps exceeding the time limit 

rd_240999:
20200610 18:04:48
Last edit: 20200610 18:08:56 

sidmaxx_007:
20200610 06:07:11
I am getting runtime error. I am using brute force in python. I also tried using the sieve of eratosthene but I am still getting runtime error. Is there any more efficient algorithm for python users?


b_subhashish:
20200603 09:07:25
I'm getting time exceeded warning when compiled on C . Any one help me!!!


crazybali:
20200531 14:30:12
I'm not getting the question clearly.


purveshmakode:
20200529 17:43:00
If you try your Python3 (time limit exceeded) code in C++, you won't get that error. 

tenshikn:
20200527 19:14:58
Someone please explain using segmented sieve


osborne_17:
20200526 16:14:05
getting runtime error 

vaibhav_19:
20200525 16:32:11
see dassatyaki's comment it's true. 

krishp:
20200524 21:51:28
.17 seconds PYTHON3

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