// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#else
#define debug(x...) {};
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define double long double
#define int long long
#define MAXN 200010

void solve() {
    int n; cin >> n;
    vector<int> a(n), ans(n, 0);
    rep(i, 0, n) cin >> a[i];
    int maxid = 0, maxv = 0;
    if (a[0] == n) {
        rep(i, 1, n) {
            if (a[i] > maxv) {
                maxv = a[i];
                maxid = i;
            }
        }
    }
    else {
        rep(i, 0, n) {
            if (a[i] > maxv) {
                maxv = a[i];
                maxid = i;
            }
        }
    }
    if (maxid == n-1) {
        rep(l, 0, n) {
            int r = n-1;
            vector<int> f;
            rep(i, r+1, n) f.push_back(a[i]);
            for (int i = r; i >= l; --i) f.push_back(a[i]);
            rep(i, 0, l) f.push_back(a[i]);
            rep(i, 0, n) {
                if (f[i] == ans[i]) continue;
                if (f[i] > ans[i]) ans = f;
                break;
            }
        }
    }
    else {
        rep(l, 0, maxid) {
            int r = maxid - 1;
            vector<int> f;
            rep(i, r+1, n) f.push_back(a[i]);
            for (int i = r; i >= l; --i) f.push_back(a[i]);
            rep(i, 0, l) f.push_back(a[i]);
            rep(i, 0, n) {
                if (f[i] == ans[i]) continue;
                if (f[i] > ans[i]) ans = f;
                break;
            }
        }
    }
    rep(i, 0, n) cout << ans[i] << " \n"[i==n-1];
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int _; cin >> _;
    while (_--) solve();

    return 0;
}