Perfect match — Eolymp

Input

Two integers $n$ and $m$ ( $1 \leq n \leq m$ 1 \leq n \leq m, $n + m \leq 1 0^{6}$ n + m \leq 10^6).

Output

Print $n$ lines. In the line $i$ print two integers $x_{i}$ x_i and $y_{i}$ y_i. $x_{i}$ x_i must be in $A$ and $y_{i}$ y_i in $B$ . Each of these pairs that you output must be a matching pair, as specified in the problem statement.

$0 \leq x_{i} \leq n - 1$ 0 \leq x_i \leq n - 1 and for any $i \neq = j$ i \neq j should be $x_{i} \neq = x_{j}$ x_i \neq x_j
$m \leq y_{i} \leq m + n - 1$ m \leq y_i \leq m + n - 1 and for any $i \neq = j$ i \neq j should be $y_{i} \neq = y_{j}$ y_i \neq y_j

Examples

Example 1

Loading

Example 2

Loading

Note

It can be proved that a solution always exists.