#include <vector>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <cassert>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
const double EPS = 1e-10;
const double PI  = acos(-1.0);

bool dfs(vi &a, int pos,int l,int r){
	if(pos==10){
		return true;
	}
	REP(i,2){
		if(i==0&&a[pos]>l&&dfs(a,pos+1,a[pos],r)){
			return true;
		}
		if(i==1&&a[pos]>r&&dfs(a,pos+1,l,a[pos])){
			return true;
		}
	}
	return false;
}

int main(){
	int n;
	cin>>n;
	REP(i,n){
		vi a(10);
		REP(i,10){
			cin>>a[i];
		}
		cout<<(dfs(a,0,0,0)?"YES":"NO")<<endl;
	}
}