#define _CRT_SECURE_NO_WARNINGS
    #include<iostream>
    #include<math.h>
    #include<string.h>
    #include<algorithm>
    #include<stack>	
    #include<queue>
    #include<vector>
    #include<string>
    #include<deque>
    #include<unordered_map>
    #include<set>	
    #include<stack>
    #include<queue>
    #define N 1001
    #define M 1000 
    #define Mid l+((r-l)>>1)
    #define Li i<<1
    #define Ri i<<1|1
    using namespace std;
    int c[N], a[N];
    int n;
    int tu[N][N] = { 0 };
    
    int main()
    {
        int n, m;
        cin >> n >> m;
        vector<set<int>> biao(n + 1);
        for (int i = 0; i < m; i++) {
            int x, y;
            cin >> x >> y;
            a[i] = x;
            c[i] = y;

           
            biao[x].insert(y);
            biao[y].insert(x);
        }
        for (int i = 0; i < m; i++) {
            tu[a[i]][c[i]] = 1;
            tu[c[i]][a[i]] = 1;

        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                cout << tu[i][j] << " ";
            }
            cout << endl;
        }
        for (int i = 1; i <= n;i++) {
            cout << biao[i].size() << " ";
            for (auto j : biao[i]) {
                cout << j << " ";
            }
            cout << endl;
        }

        return 0;
    }