A sorting algorithm A is said to have more time complexity than a sorting algorithm B if it uses more number of comparisons for sorting the same array than algorithm B.

Given that algorithm A uses X comparisons to sort an array and algorithm B uses Y comparisons to sort the same array, find whether algorithm A has more time complexity.

------ Input Format ------ 

- The first line of input will contain a single integer T, denoting the number of test cases.
- Each test case consists of two space-separated integers X and Y — the number of comparisons used by algorithms A and B to sort the array respectively.

------ Output Format ------ 

For each test case, output on a new line, YES, if the algorithm A has more time complexity than B and NO otherwise.

You may print each character of the string in uppercase or lowercase (for example, the strings YES, yEs, yes, and yeS will all be treated as identical).

------ Constraints ------ 

$1 ≤ T ≤ 100$
$1 ≤ X, Y ≤ 100$

----- Sample Input 1 ------ 
4
9 9
15 7
10 19
21 20

----- Sample Output 1 ------ 
NO
YES
NO
YES
----- explanation 1 ------ 
Test case $1$: The number of comparisons used by algorithm $A$ is $9$ and that used by $B$ is also $9$. Since the number of comparisons used by $A$ is not more than that of $B$, $A$ does not have more time complexity than $B$.

Test case $2$: The number of comparisons used by algorithm $A$ is $15$ and that used by $B$ is $7$. Since the number of comparisons used by $A$ is more than that of $B$, $A$ does have more time complexity than $B$.

Test case $3$: The number of comparisons used by algorithm $A$ is $10$ and that used by $B$ is $19$. Since the number of comparisons used by $A$ is not more than that of $B$, $A$ does not have more time complexity than $B$.

Test case $4$: The number of comparisons used by algorithm $A$ is $21$ and that used by $B$ is $20$. Since the number of comparisons used by $A$ is more than that of $B$, $A$ does have more time complexity than $B$.

Source: codechef | Difficulty: EASY


Solutions:
t = int(input())
for i in range(t):
	(x, y) = map(int, input().split(' '))
	if x > y:
		print('YES')
	else:
		print('NO')


n = int(input())
for i in range(n):
	(a, b) = map(int, input().split())
	if a > b:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(X, Y) = map(int, input().split())
	if X > Y:
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	(a, b) = map(int, input().split())
	if a > b:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	(x, y) = map(int, input().split())
	if x > y:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(A, B) = map(int, input().split())
	if A > B:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(a, b) = list(map(int, input().split()))
	if a <= b:
		print('NO')
	else:
		print('YES')


t = int(input())
while t > 0:
	(x, y) = map(int, input().split())
	if x > y:
		print('YES')
	else:
		print('NO')
	t = t - 1


try:
	for _ in range(int(input())):
		(x, y) = map(int, input().split())
		if x > y:
			print('YES')
		else:
			print('NO')
except:
	print(0)


T = int(input())
for i in range(T):
	(N, M) = map(int, input().split())
	if N > M:
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	(v, s) = map(int, input().split())
	if v > s:
		print('YES')
	else:
		print('NO')


t = int(input())
for t in range(t):
	(x, k) = map(int, input().split())
	if x <= k:
		print('NO')
	else:
		print('YES')


t = int(input())
for i in range(t):
	(a, b) = [int(x) for x in input().split()]
	if a > b:
		print('YES')
	else:
		print('NO')


n = int(input())
for i in range(n):
	x = list(map(int, input().split()))
	if x[0] > x[1]:
		print('YES')
	else:
		print('NO')


n = int(input())
for i in range(0, n):
	(x, y) = map(int, input().split(' '))
	if x < y:
		print('NO')
	elif x == y:
		print('NO')
	else:
		print('YES')


n = int(input())
for i in range(n):
	m = input().split()
	if int(m[0]) > int(m[1]):
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(n, m) = map(int, input().split())
	if n > m:
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	(a, b) = map(int, input().split())
	if a <= b:
		print('NO')
	elif a > b:
		print('YES')


k = int(input())
while k != 0:
	(a, b) = map(int, input().split())
	if a > b:
		print('YES')
	else:
		print('NO')
	k -= 1


n = int(input())
for i in range(n):
	(j, k) = map(int, input().split())
	if j > k:
		print('YES')
	else:
		print('NO')