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
neon10: 2018-11-22 17:13:58

@thegravityguy, You got TLE because you can't generate prime number upto 10^9 using Sieve...It can generate at most 10^7 prime number using sieve...

ghastslayer29: 2018-11-19 15:25:52

I swear to god I ran my python program in my terminal, I even tried it with very large numbers, and it runs quick, even though I have a crap top. Yet it says: 'time limit exceeded!'

embiway1298: 2018-11-16 17:37:17

I know the sieve of Eratosthenes method but it is showing TLE.can anyone help????

immahesh10: 2018-11-05 16:13:10

TLE

Simes: 2018-11-05 14:37:10

@stephentjj- currently 5699 people have solved it in Java, see https://www.spoj.com/ranks/PRIME1/lang=JAVA

Last edit: 2018-11-05 14:47:34
stephentjj: 2018-11-05 07:30:42

Did anyone solve this in java?

surajnobi: 2018-11-03 06:45:39

how I take two or more inputs in single line using scanf ?????

Last edit: 2018-11-03 06:46:11
dev_gupta01: 2018-11-01 13:38:07

for c++ use fast I/O and segmented sieve

thegravityguy: 2018-11-01 09:21:07

sqrt(n) approach solution is being accepted. And Sieve of Eratosthenes shows TLE. Can anybody explain this? I can clearly understand that Sieve of Eratosthenes will take up more memory but why is it taking up more time than sqrt(n) approach?

aryan_sapra: 2018-10-31 16:20:57

escobar 'Sieve Of Eratosthenes' is a better approach then 'Segmented Sieve' but still it is giving TLE.


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