#include <bits/stdc++.h>
#define N 200009
#define ll long long
#define setIO(s) freopen(s ".in", "r", stdin)
using namespace std;
int n, FL, sum;
int a[N], pos[N], id[N], L[N], R[N];
set<int> se[N];
set<int>::iterator it;
set<int> S;
int merge(int x, int y) {
    if (x < 1 || x > sum)
        return y;
    if (y < 1 || y > sum)
        return x;
    it = se[x].end();
    it--;
    if (a[*it] < a[*se[y].begin()]) {
        if (se[x].size() < se[y].size())
            swap(x, y);
        L[x] = min(L[x], L[y]);
        R[x] = max(R[x], R[y]);
        for (it = se[y].begin(); it != se[y].end(); it++) id[*it] = x, se[x].insert(*it);
        S.erase(y);
        return x;
    } else
        return y;
}
void solve() {
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
        int x;
        scanf("%d", &x), a[x] = i, pos[i] = x;
    }
    sum = 0;
    for (int i = 1, j; i <= n; i = j) {
        int pre = a[i];
        ++sum;
        for (j = i; a[j] >= pre; ++j) se[sum].insert(j), pre = a[j], id[j] = sum;
        L[sum] = sum - 1, R[sum] = sum + 1;
        S.insert(sum);
    }
    // 有 sum 个平衡树
    int pre = 0;
    int size = sum;
    int minn = N, maxx = -N;
    int flag = 0;
    for (int i = 0; i <= n; ++i) {
        if (i) {
            if (pos[i] < pre)
                break;
            else
                pre = pos[i];
            // 删掉 pos[i]
            int cur = id[pos[i]];
            // 删掉 se[cur] 中的 pos[i]
            se[cur].erase(pos[i]);
            if (se[cur].empty()) {
                int a = L[cur], b = R[cur];
                R[L[cur]] = R[cur];
                L[R[cur]] = L[cur];
                S.erase(cur);
                merge(a, b);
            } else {
                int u = cur;
                if (L[cur])
                    u = merge(L[cur], cur);
                if (R[u] <= sum)
                    merge(u, R[u]);
            }
        }
        if (flag == 1) {
            minn = min(minn, i), maxx = max(maxx, i);
            continue;
        }
        if (S.size() <= 2) {
            if (S.size() <= 1)
                minn = min(minn, i), maxx = max(maxx, i), flag = 1;
            else {
                it = S.begin();
                it++;
                if ((*se[*it].begin()) > pre)
                    minn = min(minn, i), maxx = max(maxx, i), flag = 1;
            }
        }
    }
    S.clear();
    for (int i = 0; i <= n + 1; ++i) se[i].clear();
    for (int i = 0; i <= n + 1; ++i) a[i] = pos[i] = id[i] = L[i] = R[i] = 0;
    FL = sum = 0;
    if (minn == N)
        printf("-1 -1\n");
    else
        printf("%d %d\n", minn, maxx);
}
int main() {
    // setIO("input");
    int T;
    scanf("%d", &T);
    while (T--) solve();
    return 0;
}