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
2024-01-07 05:41:39
Use segmented sieve to avoid TLE
2023-12-24 15:18:19
where can i find editorial for this problem?
2023-11-24 08:06:34
okv
2023-09-08 17:32:08
for tc m = 1 change it to 2 to avoid printing 1.
2023-08-28 15:54:23
you can save answers in unordered_map and find divisors in range of [2,sqrt(x)]
2023-08-19 13:29:11
is it possible to create an array with 1 billion items in C++. I met SIGTERM error
2023-08-15 19:12:30
my solution works totally fine using segmented sieve in my ide (g++ version 8 (something))
however it throws segmentation error when submitted on spoj. What could be the possible issue?
2023-08-12 05:57:57
why did I get runtime error?may i know the reason?
2023-06-27 07:45:33
how and where to find the solution or editorial? please provide the link

Last edit: 2023-06-27 08:12:48
2023-06-22 19:54:11
What might be the problem if I get runtime error?
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.