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
Neha: 2013-03-13 22:12:29

@Giovanni Botta I tried using Erathostenes sieve but the heap runs out of memory..

Neha: 2013-03-13 22:12:29

@ Giovanni Botta : I tried using Erathostenes sieve but the memory of heap is not to save such large numbers. How did you do it?

Daphne Fourier: 2013-03-13 22:12:29

It would be fun using Template Haskell so the calculations are done at compile time :D

Giovanni Botta: 2013-03-13 22:12:29

Still getting WA. I have NO idea what's wrong with my code: I tested multiple cases and double checked the results with Matlab. No apparent mistake!

Giovanni Botta: 2013-03-13 22:12:29

@Ahmed.Mahmoued
So there's a blank line only in between non-trivial cases and no blank line at the end? That's very confusing and not specified in the problem statement!

Ahmed.Mahmoud: 2013-03-13 22:12:29

@Giovanni Botta
input
3
1 1
56 70
11 15

Output:
59
61
67
[blank line]
11
13

Giovanni Botta: 2013-03-13 22:12:29

Getting WA over and over. I'm a little confused about how the output should be formatted. Is this correct?

Input:
3
1 1
56 70
11 15

Output:
[blank line]
59
61
67
[blank line]
11
13
[blank line]

Giovanni Botta: 2013-03-13 22:12:29

@ Michael T.: thanks! will look into that.
Just out of curiosity, did anybody solve this using Erathostenes sieve?

Vitor Santos: 2013-03-13 22:12:29

I have a TLE problem, but the output is correct.. Any help? :S

vinay: 2013-03-13 22:12:29

i am getting a NZEC error.someone please help me handle it.!


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