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
gabe3491:
20170712 12:33:39
seriously a single line mistake ruined my day..


sravan_maddika:
20170704 10:26:14
can anyone explain the code please


sidh13:
20170702 17:30:07
MY code is working fine in my system in language c++ but here it shows time limit exceeded although i have tried it many times please help!!


skap_21:
20170701 16:59:22
I KEEP GETTING SEGMENTATION ERROR EVEN THOUGH IT WORKS PERFECTLY FINE ON ideone, codeforces and codechef


sanjitpd_777:
20170701 04:54:39
those getting TLE


manish_nit97:
20170628 09:08:10
please provide a proper solution of TLE 

priyesh212:
20170625 12:55:46
my code is working fine on codechef ide but here its showing time limit exceeded 

rohit5840:
20170622 05:22:34
where i can see my submitted answer?


larunrahul:
20170621 06:30:53
For each of the number in the range,


callmebray:
20170620 18:58:00
This may be the dumbest question ever asked on here.. I know I can figure out how to print all the prime numbers, but i'm not sure how to actually read the input into my Javascript function?

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