import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
import java.util.stream.IntStream;

public class Main {

	public static void main(String[] args) throws IOException {
		new Main().solve();
	}

	private void solve() throws IOException {
		try {
			//			solveProblem();
			solveA();
		} finally {
			if (in != null) {
				in.close();
			}
			if (out != null) {
				out.flush();
				out.close();
			}
		}

	}

	private void solveProblem() {
		int n = nextInt();
		int[] wk = IntStream.range(0, n).map(i -> nextInt()).toArray();
		int a = nextInt();

		boolean[][] dp = new boolean[n + 1][a + 1];

		dp[0][0] = true;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j <= a; j++) {
				if (j >= wk[i]) {
					dp[i + 1][j] = dp[i][j - wk[i]] || dp[i][j];
				} else {
					dp[i + 1][j] = dp[i][j];
				}

			}
		}

		out.println(dp[n][a]);
	}

	private void solveA() {
		int n = nextInt();
		for (int i = 0; i < n; i++) {
			int[] wk = IntStream.range(0, 10).map(j -> nextInt()).toArray();
			boolean res = recursiveA(wk, 0, 0, 0);
			out.println(res ? "YES" : "NO");
		}

	}

	private boolean recursiveA(int[] wk, int lBox, int rBox, int currentI) {
		if (currentI == 9) {
			return wk[currentI] > lBox || wk[currentI] > rBox;
		}
		if (wk[currentI] < lBox && wk[currentI] < rBox) {
			return false;
		}

		boolean res = false;
		if (wk[currentI] > lBox) {
			res |= recursiveA(wk, wk[currentI], rBox, currentI + 1);
		}
		if (wk[currentI] > rBox) {
			res |= recursiveA(wk, lBox, wk[currentI], currentI + 1);
		}
		return res;

	}

	private final PrintWriter out = new PrintWriter(System.out);
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public int nextInt() {
		return Integer.parseInt(next());
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
}


Measured memory_bytes: 30700