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
2017-11-08 02:37:20
where can I see my submitted code?

2017-11-02 08:54:33
limit time.

Last edit: 2017-11-02 08:55:15
2017-11-02 03:05:46
My code is correct but it is showing run time error....help me

Last edit: 2017-11-02 03:06:09
2017-10-30 09:22:27
tle is there for more than 20000
2017-10-30 03:18:33
done in 0.01s in C++
2017-10-25 20:06:11
did it using java , but same code in python shows time limit exceeded
2017-10-22 09:18:13
0.12s
2017-10-15 02:17:42
Hi all. Please show me the source code? What is prime generator :) Help
2017-10-11 21:17:42
getting nzec error in java even with correct output :(
2017-10-04 09:33:17
finally done in 0.58s in C++
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.