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
saisudhama_123: 2021-03-25 17:34:10

In C ,time limit exceeded what to do

manoj015: 2021-03-24 07:17:28

even though my code is working in my local env. but, getting wrong answer after submitting here...Please help me?

shariqaftab333: 2021-03-17 10:13:30

i m dam sure my code is right but it is showing wrong answer
some one pls help

thanh913: 2021-03-14 20:11:24

Now 0.01 with scanf :3

thanh913: 2021-03-14 19:30:23

i got 0.06 using modified sieve :D

samyakj: 2021-03-14 11:28:58

Time limit exceeded what should I do?

mailforspam: 2021-03-07 01:27:05

furking piece of shit. I realized so pretty algo but site doesn't accept it and idk why

atauln: 2021-03-04 00:44:56

I just spent 30 minutes working on this, and then added on an if statement to remove the '1' I always get, and then I got it right. Spent 30 MINUTES working on optimisations, and it was all because of a ONE

execusioner: 2021-02-24 04:08:45

i love you

mohsehga: 2021-02-23 18:00:21

What should be the output if there is not prime number possible between the the range for example : 25 27 ??


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