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

using ll = long long;
using ld = long double;

#define all(a) begin(a), end(a)
#define len(a) int((a).size())

void solve(int /* test_num */) {
    int n;
    cin >> n;
    vector<int> a(n);
    for (auto &x : a) {
        cin >> x;
    }

    int l = 0;
    while (l + 1 < n && a[l + 1] >= a[l]) {
        l++;
    }
    int r = n - 1;
    while (r > 0 && a[r - 1] >= a[r]) {
        r--;
    }

    for (int i = r; i <= l; i++) {
        cout << i + 1 << ' ';
    }
    cout << '\n';
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int tests;
    cin >> tests;
    for (int test_num = 1; test_num <= tests; test_num++) {
        solve(test_num);
    }
}