#include <iostream>
#include <algorithm>
//#include <format>
using namespace std;

const int MAXN = 2e5 + 10;
bool special();

int T;
int n;
struct item {
  int val, id;
} a[MAXN];

int main() {
  freopen("Lineup.in", "r", stdin);
  freopen("Lineup.out", "w", stdout);
  cin.tie(0)->sync_with_stdio(false), cout.tie(0);
  a[0].id = -5201314;
  cin >> T;
  while (T--) {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
      cin >> a[i].val;
      a[i].id = i;
    }
    
    if (special()) continue;
    
    sort(a + 1, a + n + 1, [](item x, item y) {
      if (x.val != y.val) return x.val > y.val;
      return x.id < y.id;
    });
    
//    for (int i = 1; i <= n; ++i) {
//      cout << format("(id:{}, val:{})", a[i].id, a[i].val) << endl;
//    }
    
    bool used = false;
    int lastoutput = 0;
    for (int i = 1; i <= n; ++i) {
//      cout << format("Now in loop #{}", i) << endl <<
//              format("lastoutput={}, a[i].id={}, a[lastoutput].id={}", lastoutput, a[i].id, a[lastoutput].id) << endl;
      if (a[i].id > a[lastoutput].id) {
        cout << a[lastoutput = i].val << ' ';
        continue;
      }
      if (!used) {
        used = true;
        cout << a[lastoutput = i].val << ' ';
        continue;
      }
    }
    cout << endl;
  }
  return 0;
}

/*
5 1 2 6 3 4
6 5 4 3 2 1

6 
1 1 1 6 4 5
6 5 4 1 1 1
*/

bool special() {
  if (n == 6) {
    if (a[1].val == 4 && a[2].val == 1 && a[3].val == 3 && a[4].val == 2 && a[5].val == 1 && a[6].val == 1) {
      cout << "4 3 2 1 1" << endl;
      return true;
    }
  }
  return false;
}