# PRIME1 - Prime Generator

## 题意翻译

求给定的两个数之间的素数
Translated by @kaiming

## 题目描述

Peter wants to generate some prime numbers for his cryptosystem. Help him! Your task is to generate all prime numbers between two given numbers!

## 输入输出格式

### 输入格式

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.

### 输出格式

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.

## 输入输出样例

### 输入样例 #1

```
2
1 10
3 5
```

### 输出样例 #1

```
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](http://www.spoj.com/problems/PRINT/) as a more challenging problem.