In the first line, print a single integer $x$ ($1 \leq x \leq n \cdot m$) --- the number of optimal positions.

In each of the next $x$ lines, print the optimal positions ($x;y$) for waiting for the mole ($1 \le x \le n$, $1 \le y \le m$).

Positions can be printed in any order.