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, nm<=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 5Warning: 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
satish7978:
20240305 18:43:36
use segmented sieve 

sathvik_g:
20240221 12:21:55
zxvxv 

hauntedcode:
20240213 01:06:45
easy easy Last edit: 20240213 01:07:37 

beyondcode:
20240212 20:41:59
study hard 

otoya:
20240206 13:37:20
snder, segmented sieve, check cp algorithms 

snder_z07:
20240206 03:51:12
someone explain to me


snder_z07:
20240206 03:50:45
sainuuu mobgolchuuuda


magnus_03:
20240107 05:41:39
Use segmented sieve to avoid TLE 

zingernut:
20231224 15:18:19
where can i find editorial for this problem?


zhuxuqi:
20231124 08:06:34
okv 
Added by:  Adam Dzedzej 
Date:  20040501 
Time limit:  6s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS PERL6 