#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define ld long double
#define ull unsigned long long
#define lcm(a,b) ((a*b)/__gcd(a,b))
#define debug(x) cout << "Debug : " << x << endl;
const double PI = 2 * acos(0.0);
const int MOD = 1000000007;

void solve(){
     int n;
     cin >> n;
     vector <int> a(n);
     for (auto &i : a) cin >> i;
     deque <int> dq;

     int i = 0, j = n - 1;

     if (a[i] <= a[j]){
        dq.push_back(a[i]);
        ++i;
     }
     else{
        dq.push_back(a[j]);
        --j;
     }

     bool pos = true;

     while (i <= j){
        int c;
        if (a[i] <= a[j]){
            c = a[i];
            i++;
        }
        else{
            c = a[j];
            j--;
        }

        if (dq.back() >= dq.front()){
            if (dq.front() >= c){
                dq.push_front(c);
            }
            else if (dq.back() <= c){
                dq.push_back(c);
            }
            else{
                pos = false;
                break;
            }
        }
        else if (dq.back() <= dq.front()){
            if (dq.back() <= c){
                dq.push_back(c);
            }
            else if (dq.front() >= c){
                dq.push_front(c);
            }
            else{
                pos = false;
                break;
            }
        }
     }

     cout << (pos ? "YES" : "NO") << endl;
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int t;
    cin >> t;

    while(t--){
        solve();
    }
}