#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>

using namespace std;
const int nodes = 1004;
const int edges = 100005;
int head[nodes], nexts[nodes], ver[nodes], du[nodes] = {0};
int matrix[nodes][nodes];

int tot = 0;

void add(int x, int y)
{
    ver[++tot] = y;
    nexts[tot] = head[x];
    head[x] = tot;
}

void vis(int x)
{
    vector<int> a;
    for (int i = head[x]; i; i = nexts[i])
    {
        int y = ver[i];
        a.push_back(y);
    }
    if (a.size()){
    sort(a.begin(), a.end());
    for (int i=0; i<a.size()-1; i++)
    {
        cout << a[i] << " ";
    }
    cout << a[a.size()-1] << endl;
    }
    else
    cout << endl;
}


int main()
{
    int n, m;
    cin >> n >> m;
    memset(matrix, 0, nodes*nodes);
    memset(du, 0, sizeof(du));
    for (int i=1; i<=m; i++)
    {
        int x, y;
        cin >> x >> y;
        add(x, y);
        add (y, x);
        matrix[x][y] = 1;
        matrix[y][x] = 1;
        du[x]++;
        du[y]++;
    }

    
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<n; j++)
        {
            cout << matrix[i][j] << " ";
        }
        cout <<matrix[i][n]<< endl;
    }
    for (int i=1; i<=n; i++)
    {
        cout << du[i] << " ";
        vis(i);
    }
    return 0;
}