PRINT - Prime Intervals

在这个问题中，你需要输出所给的区间中所有的质数。 $t$为数据组数，接下来有$t$行。 每行有两个由空格分隔的整数$L$和$U$。$L$为所给区间的最小值，$U$为所给区间的最大值。 数据范围：$[t<=150]$ $[2<=L<U<=2147483647]$ $[U-L<=1000000]$。 对于每组数据必须按从小到大的的顺序输出区间$[L,U]$中的所有质数。 感谢@zhuzhirui2005 提供的翻译

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.

2
2 10
3 7

2
3
5
7
3
5
7