#include <algorithm>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
const int N = 2e5 + 5;
ll a[N];
ll hm[N];
int t, n;
ll gt(int x, int y, int z) {
    // 当把原先第x移到y前时，第z项的下标多少?
    if (z < y || z > x)
        return z;
    else if (z == y)
        return x;
    else
        return z - 1;
}
auto cmp(vector<ll> v1, vector<ll> v2) {
    int len = min(v1.size(), v2.size());
    for (int i = 0; i < len; i++) {
        if (v1[i] != v2[i])
            return v1[i] > v2[i];
    }
    return v1.size() > v2.size();
};
auto solve0() {
    vector<ll> ans;
    hm[n] = a[n];
    for (int i = n - 1; i >= 1; i--)
        hm[i] = max(a[i], hm[i + 1]);
    for (int i = 1; i <= n; i++)
        if (a[i] == hm[i])
            ans.push_back(a[i]);
    return ans;
}
auto solve(int x, int y) {
    vector<ll> ans;
    hm[n] = a[gt(x, y, n)];
    for (int i = n - 1; i >= 1; i--)
        hm[i] = max(a[gt(x, y, i)], hm[i + 1]);
    for (int i = 1; i <= n; i++)
        if (a[gt(x, y, i)] == hm[i])
            ans.push_back(a[gt(x, y, i)]);
    return ans;
}
int main() {
    freopen("Lineup.in", "r", stdin);
    freopen("Lineup.out", "w", stdout);
    cin >> t;
    while (t--) {
        cin >> n;
        for (int i = 1; i <= n; i++) {
            cin >> a[i];
        }
        auto ans = solve(0, 0);
        for (int i = 2; i <= n; i++) {
            for (int j = 1; j <= i - 1; j++) {
                if (a[i] < a[j])
                    continue;
                auto now = solve(i, j);
                if (cmp(now, ans))
                    ans = now;
            }
        }
        for (auto i : ans) {
            cout << i << " ";
        }
        cout << endl;
    }
}