Adjacency Matrix
----------------
In this problem, you just have to read an undirected graph and print out the corresponding
adjacency matrix.

Input
-----
The input will contain multiple instances.  The first line of each instance will
contain two integers n and m, representing the number of nodes and edges in the
graph, respectively.  Following this, there will m lines, each containing two
integers i and j, where 1 <= i < j <= n, indicating that there is an edge
connecting the nodes i and j.

The end of the input will be indicated by a line with n=m=0.  Do not produce
any output for this line of input.

Output
------
For each input instance, output the adjacency matrix of the graph.  Print a blank
line between adjacency matrices for different input instances.  Do not print a blank
line at the end of the output.

Sample Input
------------
3 3
1 2
1 3
2 3
5 2
1 4
2 3
0 0

Sample Output
-------------
0 1 1
1 0 1
1 1 0

0 0 0 1 0
0 0 1 0 0
0 1 0 0 0
1 0 0 0 0
0 0 0 0 0