#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn=1e6+5;
int n,m;
int e[maxn][maxn];
vector<int> g[maxn];
void add_edge(int u,int v)
{
	e[u][v]=1;
}
void bdd_edge(int u,int v)
{
	g[u].push_back(v);
}
int main()
{
    cin>>n>>m;
    for (int i=1;i<=m;i++)
    {
        int u,v;
        cin>>u>>v;
        add_edge(u,v);
        add_edge(v,u);
        bdd_edge(u,v);
        bdd_edge(v,u);
    }
    for (int i=1;i<=n;i++)
    {
        for (int j=1;j<=n;j++)
        {
            cout<<e[i][j]<<" ";
        }
        cout<<endl;
    }
    for (int i=1;i<=n;i++)
    {
        cout<<g[i].size()<<" ";
        sort(g[i].begin(),g[i].end());
        for (int j=0;j<g[i].size();j++)
        {
            cout<<g[i][j]<<" ";
        }
        cout<<endl;
    }
    return 0;
}