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 
hide comments
adityavasistha:
20150830 17:35:29
showing time out


revolt33:
20150830 11:27:16
finally did it, took me 3 days to solve... :P 

apprentiz:
20150828 07:52:59
working fine with codeblocks within time limit.


magma1983:
20150826 19:57:55
Sample correct in ideone, Python.


satylogin:
20150825 08:50:51
the same problem is happening with me


aloysiusabreo:
20150824 13:19:38
working fine on ideone and codechef ide. shows runtime error on submission. any ideas? 

vtaneja:
20150824 10:29:07
I am getting timeout...


Tanvi:
20150823 14:05:28
getting SIGSEGV error. My code is working fine on Ideone. What should I do? 

raj23659:
20150821 15:51:58
what size should we choose for arrays?


silentguardian:
20150817 18:12:08
What causes a SIGABRT error?I tried submitting a sieve of eratosthenes solution. 