Q2

#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        long long arr[n];
        for (int i = 0; i < n; i++)
        {
            cin >> arr[i];
        }
        sort(arr, arr + n);
        int pos = 1;
        for (int i = 0; i < n;)
        {
            cout << arr[i++];
            while (i<n && arr[i] == arr[i - 1])
            {
                cout << ' ' << arr[i++];
            }
            cout << '\n';
            pos++;
            if (pos > 3)
                break;
        }
        cout << '\n';
    }
    return 0;
}