Ezio can manipulate at most X number of guards with the apple of eden.

Given that there are Y number of guards, predict if he can safely manipulate all of them.

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

- First line will contain T, number of test cases. Then the test cases follow.
- Each test case contains of a single line of input, two integers X and Y.

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

For each test case, print \texttt{YES} if it is possible for Ezio to manipulate all the guards. Otherwise, print \texttt{NO}.

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

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

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

----- Sample Input 1 ------ 
3
5 7
6 6
9 1
----- Sample Output 1 ------ 
NO
YES
YES
----- explanation 1 ------ 
Test Case $1$: Ezio can manipulate at most $5$ guards. Since there are $7$ guards, he cannot manipulate all of them.

Test Case $2$: Ezio can manipulate at most $6$ guards. Since there are $6$ guards, he can manipulate all of them.

Test Case $3$: Ezio can manipulate at most $9$ guards. Since there is only $1$ guard, he can manipulate the guard.

Source: codechef | Difficulty: EASY


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


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


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


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


t = int(input())
for i in range(t):
	case = input().split()
	x = int(case[0])
	y = int(case[1])
	if x >= y:
		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')


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


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


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


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


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


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


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


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


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


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


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


for _ in range(int(input())):
	(o, m) = map(int, input().split())
	if o < m:
		print('NO')
	else:
		print('YES')


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


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


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