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
cmao: 2020-01-22 03:08:16

good explanation:
https://www.geeksforgeeks.org/<-------------------snip--->

=(Francky)=> Please don't spoil in comments. Use forum for those kind of links, or codes. Please read the notes below before posting a comment.

Last edit: 2020-01-22 21:07:06
cmao: 2020-01-22 02:58:33

same code is running fine in c++ with exactly same logic but in Python 3 it is throwing me TLE. I am using sqrt logic both in c++ and Python and not sieve algorithm. Does this mean that SPOJ time limits are the same irrespective of languages used? That would be terrible. anyone else able to solve Prime problem with python 3, without sieve with sqrt and achieved success?

Last edit: 2020-01-22 02:59:20
ericwen46: 2020-01-16 08:30:05

Is there anyone using the swift programming language?

tyrion_909: 2020-01-07 14:22:12

isprime package is working on my PC,but not here.Explain somebody ,please?

tamaroth: 2020-01-06 17:03:00

Well, you cannot use external libraries in python it seemed. I've tried using a 'primesieve' library but it always ends with NZEC ;\

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.


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