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.Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel Pentium G860 3GHz) 
Languages:  All except: NODEJS PERL 6 SCM chicken 
hide comments
harshgupta007:
20150702 13:46:59
pls help me out


kratigarg167:
20150629 14:40:11
My code is working fine on my pc but here I am getting wrong answer and following error:


knabmn:
20150628 21:11:50
Why I get everytime a timeout error? 

aagnihotri:
20150628 19:55:22
This was a tough one. I used PHP. You should look into the MillerRabin method. And check to see if there is a native implementation of it. 

dumborakesh:
20150628 17:55:06
Can any one help? What to do.... Time limit exceed 

dumborakesh:
20150628 17:52:56
Omg .. Time limit exeed .. What is this ... ?? 5 time 

Ashish:
20150627 10:36:48
AC in first go, 0.00 :) 

adityaparmar:
20150626 22:22:41
take uint variable


atg_abhishek:
20150626 18:17:55
Works correctly here but I still keep getting a NZEC, can anyone help? http://ideone.com/4McRBf 

poojan :
20150626 17:58:02
why wrong ans????????????????????????????????????????????????????? 