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
2013-03-13 22:12:29 jinkies
@Adam Dzedzej:
Please verify Solution ID 8535255.
Getting WA even though all boundary cases are satisfied.
Please check.
2013-03-13 22:12:29 nbcool
I am getting time limit exceeded for n^2 what is the problem in my code
2013-03-13 22:12:29 nick
roshin i had a same problem (another program) and the problrm was that i wrote in c++ (g++ 4.0.0-8) but submitted it as c++(g++ 4.3.2) be careful maybe you have a same problem as me


Last edit: 2013-01-17 09:25:11
2013-03-13 22:12:29 khasi
@mario spoj kar rahe ho tle ka matlab ni pata....matlab tumhare code ki aisi ki tesi ho gaye
2013-03-13 22:12:29 khasi
ye to humne 11v mai hi kar diya tha par wo kya hai na hamkoooo khasssssiii haiii auuuuuuuuu........
2013-03-13 22:12:29 Mario Montinola
what's the meaning of exceeding time limit? i know my program works but why does it says that? can anyone tell me?
2013-03-13 22:12:29 VARUN KUMARE
Hey guys also try it!!!
1 1
2 4
3 5
1 10
999900000 1000000000
2013-03-13 22:12:29 roshin
the program works when i run[gcc] in my system.
but here its showing compilation error.can anyone help me on this.......
2013-03-13 22:12:29 Chitirala Nagendra Vijay Kumar
can any one help me improving my approach.. thanQ.. <snip>

Last edit: 2022-06-19 12:27:16
2013-03-13 22:12:29 capint
One of the error I encountered is forgetting the case when m = n. For people getting exceeded error, pay attention to the detail n-m<=100000.
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.