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, n-m<=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
5
Warning: 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
sudeshna1: 2015-05-30 19:53:41

2 days. I am stuck. Don't know what to do, It continously shows time limit exceeded. Help?

yoprati: 2015-05-27 21:11:13

It's running on my pc but showing wrong answer in when I submit. any how I can know what is actually wrong ?

kashish_shah: 2015-05-27 09:13:35

I ran my code on ideone and it is working properly but when i am running it here on spoj then it is showing time limit exceeded. What should i do? please help

Barun Parruck: 2015-05-27 09:11:56

Yup, time limit issues in Python...can do it in C++ tho :X

r4reejh: 2015-05-23 17:59:28

Time limit issues in Python.

Dushyant Singh: 2015-05-19 09:44:00

@dr_strange - Yes, i did it using a simple property of prime numbers.

britoboy: 2015-05-19 01:13:22

this is very hard in Scala... What about time limits BY language?

keerthi_1994: 2015-05-18 13:35:24

what is NZEC? could any one help me out..n also what is MEM under analysis give fr our submission

vivek keshore: 2015-05-18 12:14:42

Finally done it.

dr_strange: 2015-05-17 20:45:40

is there a way to do it without sieve


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