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
ankurkayal: 2020-01-02 19:09:08

using a naive method works as n-m = 100000; which is pretty low to get the solution accepted and sieve will give memory error, but you can use sieve of atkin if you want.

ashu_gupta23: 2020-01-02 10:07:34

i use sieve of erotheseness but it still show run time error can someone help me

awkravchuk: 2020-01-01 21:23:31

I'm getting NZEC, where can I see the error?

aryan__0406: 2019-12-28 20:01:28

I used segmented sieve still its taking too much time.
I don't know why?

cardcounter21: 2019-12-26 03:09:11

It turns out that it does not support input() for python3, I don't know why, but it says TLE, when it achieves the goal in less than 1 second.

krishp: 2019-12-22 03:12:24

I am pretty sure that simple sieve will not work as it only reliably works for numbers from 1 to 10,000,000 without causing segmentation fault on c++. Use sieve of atkin for better results.

abhrant: 2019-12-19 21:22:02

can i use isprime package in python???

amishbhat04: 2019-12-18 09:43:20

getting tle ..... I used eratothenes sieve.....
i ran the code on code blocks time taken is 1.9 sec well under 6s that is the time limit

Last edit: 2019-12-18 09:44:46
dvjpy786: 2019-12-17 14:50:21

use sieve of eratosthenes for solving this problem

psurya10: 2019-12-13 12:45:09

i got tle but the ideone gives correct output and in 0.11s


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