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.

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

hide comments
2016-10-08 00:01:34
i dont get this, do you have to create a method that takes in the inputs or how does it my code gets called when i submit it?
2016-10-07 17:51:00
Using naive algorithm O(m-n), got AC 0.96. Weird...
2016-10-06 06:42:17
all about time limit
2016-10-01 12:53:39
Study the segmented sieve
2016-09-24 13:50:50
Can anyone tell me how i can get correct code for this problem??
Thanks in advance....
2016-09-09 15:13:17
my code runs on ideone with time:0.06 but here ir shows time limit exceeded ??
2016-09-08 00:54:12
my code runs on ideone withe success, but gives runtime error here.
2016-09-07 08:33:22
If i use sieve it shows segmentation error ? how to encounter this ?
I have solved this without sieve but I want to know the other process


Last edit: 2016-09-07 08:46:47
2016-09-04 19:50:03
can i use segmented SOE if input is small or it is only applicable on large inputs.
2016-08-31 15:28:14
how are you all storing the result.?
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.