/*
   对数组元素排序 再对数组排序
*/
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n;
    cin >> n;
    //创建n个数组
    vector<vector<int>> array(n);
    //添加数据
    for ( int i = 0; i < n; i++ ) {
        int x;
        cin >> x;
        //根据x调整数组大小 用resize()
        array[i].resize(x);
        //输入
        for ( int j = 0; j < x; j++ ) {
            cin >> array[i][j];
        }
        //数组元素排序
        sort(array[i].begin() , array[i].end());
    }
    //输出
    for ( int i = 0; i < n; i++ ) {
        //数组排序
        sort(array.begin() , array.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;
    cin >> n;
    vector<vector<int>> arrays(n);

    for (int i = 0; i < n; i++) {
        int size;
        cin >> size;
        for (int j = 0; j < size; j++) {
            int num;
            cin >> num;
            arrays[i].push_back(num);
        }
    }

    for (int i = 0; i < n; i++) {
        sort(arrays[i].begin(), arrays[i].end());
    }

    sort(arrays.begin(), arrays.end());

    for (int i = 0; i < n; i++) {
        for (const auto& elem : arrays[i]) {
            cout << elem <<" ";
        }
        cout << endl;
    }

    return 0;
}

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

int main()
{
    vector<int> a[1003];
    int n;
    cin >> n;
    int x, y;
    int c;
    for (int i = 0; i < n; i++)
    {
        cin >> c;
        for (int j = 0; j < c; j++)
        {
            cin >> x;
            a[i].push_back(x);
        }
        sort(a[i].begin(), a[i].end());
    }

    sort(a, a + n);

    for (int i = 0; i < n; i++)
    {
        for (auto &ele : a[i])
        {
            cout << ele << ' ';
        }
        cout << endl;
    }

    return 0;
}