+ Time limit: 2 seconds + Memory limit: 256 megabytes ---------- Assume $G$ is an $n$-vertex, $m$-edge graph with the set of vertices $\{v_1, v_2, \dots, v_n\}$. The adjacency matrix of $G$, usually denoted by $A$, is an $n \times n$ matrix such that the entry in row $i$ and column $j$ is equal to 1 if and only if the edge $\{v_i, v_j\}$ is present in $E$. The graph $G$ is given to you, and we ask you to print the adjacency matrix of $G$. # Input The first line of the input contains two space-separated integers, $n$ and $m$, which represent the number of vertices and the number of edges of graph $G$, respectively. $$1 \leq n \leq 1000$$ $$0 \leq m \leq \frac{n(n - 1)}{2}$$ The next $m$ lines contain two space-separated numbers, $u_i$ and $v_i$, indicating the existence of the edge $u_i v_i$ in graph $G$. $$1 \leq u_i \neq v_i \leq n$$ It is guaranteed that every edge existing in $G$ is given exactly once in the input. # Output The output consists of $n$ lines, where each line contains $n$ integers without separation (no spaces). The number written in row $i$, column $j$ represents the entry $a_{i, j}$ in matrix $A$. # Examples ## Sample Input 1 ``` 3 2 1 2 1 3 ``` ## Sample Output 1 ``` 011 100 100 ``` ## Sample Input 2 ``` 5 4 2 3 3 5 5 2 1 4 ``` ## Sample Output 2 ``` 00010 00101 01001 10000 01100 ``` ## Sample Input 3 ``` 1 0 ``` ## Sample Output 3 ``` 0 ```