#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n,m;
    cin >> n >> m;
    //创建n个数组
    vector<vector<int>> array(n);
    //进行m次操作
    for ( int i = 0; i < m; i++ ) {
        int x,y;
        cin >> x >> y;
        array[x-1].push_back(y);
    }
    //输出操作后的数组
    for( int i = 0; i < n; i++ ) {
        //首先输出第n个数组的数据个数
        cout << array[i].size();
        //排序
        sort(array[i].begin(),array[i].end());
        //遍历
        for ( size_t j = 0; j < array[i].size(); j++ ) {
            cout << " " << array[i][j];
        }
        //换行
        cout << endl;
    }
    return 0;
}

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

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    
    vector<vector<int>> arrays(n);

    for (int i = 0; i < m; i++) {
        int x, y;
        cin >> x >> y;
        arrays[x - 1].push_back(y);
    }

    for (int i = 0; i < n; i++) {
        sort(arrays[i].begin(), arrays[i].end());
        cout << arrays[i].size();
        for (const auto& num : arrays[i]) {
            cout << " " << num;
        }
        cout << endl;
    }

    return 0;
}

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, m, x, y;
    cin >> n >> m;
    map<int, vector<int>> arr;

    for (int i = 0; i < m; i++)
    {
        cin >> x >> y;
        arr[x].push_back(y);
    }

    for (auto &ele : arr)
    {
        sort(ele.second.begin(), ele.second.end());
    }
    
    for (int i = 1; i <= n; i++)
    {
        cout << arr[i].size();
        for (auto &num : arr[i])
        {
            cout << " " << num;
        }
        cout << endl;
    }
    
    return 0;
}