There is an $N \times N$ grid. Let $(i, j)$ denote the cell at the $i$\-th row from the top and the $j$\-th column from the left.
You are to fill each cell with $0$ or $1$. Construct one method to fill the grid that satisfies all of the following conditions:
* The cells $(A_1,B_1), (A_2,B_2), \dots, (A_M,B_M)$ contain $1$.
* The integers in the $i$\-th row sum to $M$. $(1 \le i \le N)$
* The integers in the $i$\-th column sum to $M$. $(1 \le i \le N)$
It can be proved that under the constraints of this problem, there is at least one method to fill the grid that satisfies the conditions.
## Constraints
* $1 \le N \le 10^5$
* $1 \le M \le \min(N,10)$
* $1 \le A_i, B_i \le N$
* $(A_i, B_i) \neq (A_j, B_j)$ if $i \neq j$.
## Input
The input is given from Standard Input in the following format:
$N$ $M$
$A_1$ $B_1$
$A_2$ $B_2$
$\vdots$
$A_{M}$ $B_{M}$
[samples]