#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
using ll = long long;

void solve() {
    int n;
    cin >> n;
    deque<ll> v(n);
    for(int i = 0; i < n; i++) {
        cin >> v[i];
    }
    deque<ll> dq(v.begin(), v.end());
    sort(dq.begin(), dq.end());
    while(dq.size()) {
        if(dq[0] == v[0] or dq[0] == v.back()) {
            if(dq[0] == v[0]) {
                v.pop_front();
            }
            else v.pop_back();
            dq.pop_front();
        }
        else if(dq.back() == v[0] or dq.back() == v.back()) {
            if(dq.back() == v[0]) {
                v.pop_front();
            }
            else v.pop_back();
            dq.pop_back();
        }
        else break;
    }
    if(dq.size()) cout << "NO" << endl;
    else cout << "YES" << endl;
    return;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}