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
akarsh777:
20200322 22:15:05
AS SOON AS THE VALUE OF COUNTER IS MORE THAN 1,COME OUT OF LOOP,AC IN ONE GO....THANK ME LATER


bhavika_99:
20200321 06:19:34
using the usual prime number code with square root will give u the answer. 

armitage226:
20200320 16:05:32
how do i take input with a space in between in c++ 

navin123:
20200318 12:59:01
aparna_15


nathanaxel:
20200318 05:09:39
puede 

aparna_15:
20200316 09:36:30
when i am running my code in other ide... my code is correct and giving the correct output but when i submit it here its givng time limit exceeded error.


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 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 