prime generator with less complexity and less memory
In this problem you have to print all primes from given interval.
t - the number of test cases, then t lines follows. [t <= 150]
On each line are written two integers L and U separated by a blank. L - lower bound of interval, U - upper bound of interval, [2 <= L < U <= 2147483647] [U-L <= 1000000].
For each test case output must contain all primes from interval [L; U] in increasing order.