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
2021-02-16 17:53:24
test cases are weak solved it without using sieve
2021-01-18 15:28:25
odd loop+flag +2 loops
2021-01-12 17:01:59
<snip>
I ran it on vs code. Its absolutely fine there. Can anyone say why its showing wrong?

[NG]: Don't post any code here. Use forum for debug help and discussion.

Last edit: 2021-01-12 22:48:29
2021-01-03 19:17:09
brute force works but segmented sieve gives tle
2021-01-03 19:02:49
Sieve will give a runtime error because the array size(n>10^9) is too large to be stored in ram use segmented sieve
2020-12-25 11:57:51
I thought this is a easy problem but....when i saw sieve algo....then i am start crying
2020-12-18 17:10:39
Test cases are definitely weak. I got away with ~7s processing for some cases.
2020-12-11 01:44:26
Bruteforce works
2020-12-05 11:55:58
@the_monster_01 "easy peezy lemon quezzy ||| just did in 5 min"? lies, more like 12 failed attempts over an hour, before finally being accepted 4 days later

Last edit: 2020-12-05 14:04:52
2020-12-05 09:02:42
use segmented sieve
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.