Chef's current rating is X, and he wants to improve it. It is generally recommended that a person with rating X should solve problems whose difficulty lies in the range [X, X+200], i.e, problems whose difficulty is at least X and at most X+200.

You find out that Chef is currently solving problems with a difficulty of Y.

Is Chef following the recommended practice or not?

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

- The first line of input will contain a single integer T, denoting the number of test cases. The description of the test cases follows.
- Each test case consists of a single line of input, containing two space-separated integers X, Y.

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

For each test case, output on a new line YES if Chef is following the recommended practice style, and NO otherwise.

Each letter of the output may be printed in either lowercase or uppercase. For example, the strings YES, yEs, and Yes will be considered identical.

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

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

----- Sample Input 1 ------ 
5
1300 1500
1201 1402
300 4000
723 805
1330 512

----- Sample Output 1 ------ 
YES
NO
NO
YES
NO

----- explanation 1 ------ 
Test case $1$: Chef's current rating is $1300$, so he should solve problems with difficulty lying in $[1300,1500]$. Since $1500$ lies in $[1300,1500]$, Chef is doing his practice in a recommended way :)

Test case $2$: Chef's current rating is $1201$, so he should solve problems with difficulty lying in $[1201,1401]$. Since $1402$ does not lie in $[1201,1401]$, Chef is not doing his practice in a recommended way :(

Test case $3$: Chef's current rating is $300$, so he should solve problems with difficulty lying in $[300,500]$. Since $4000$ does not lie in $[300,500]$, Chef is not doing his practice in a recommended way :(

Test case $4$: Chef's current rating is $723$, so he should solve problems with difficulty lying in $[723,923]$. Since $805$ lies in $[723,923]$, Chef is doing his practice in a recommended way :)

Test case $5$: Chef's current rating is $1330$, so he should solve problems with difficulty lying in $[1330,1530]$. Since $512$ does not lie in $[1330,1530]$, Chef is not doing his practice in a recommended way :(

Difficulty: EASY
Tags: Implementation

Starter code:

Solutions:
for i in range(int(input())):
	(a, b) = map(int, input().split())
	if b >= a and b <= a + 200:
		print('YES')
	else:
		print('NO')


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


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


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


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


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


def rating(X, Y):
	if Y >= X and Y <= X + 200:
		return 'YES'
	else:
		return 'NO'
N = int(input())
for i in range(N):
	(X, Y) = map(int, input().split())
	print(rating(X, Y))


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


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


T = int(input())
for t in range(T):
	(X, Y) = map(int, input().split())
	q = X + 200
	if Y <= q and Y >= X:
		print('YES')
	else:
		print('NO')


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


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


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


T = int(input())
for i in range(T):
	(x, y) = [int(i) for i in input().split()]
	if y >= x and y <= x + 200:
		print('YES')
	else:
		print('NO')


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


i = int(input(''))
j = 0
while j < i:
	(x, y) = map(int, input('').split())
	if y <= x + 200 and y >= x:
		op = 'YES'
	else:
		op = 'NO'
	j += 1
	print(op)


T = int(input())
for i in range(T):
	(X, Y) = map(int, input().split())
	max_num = X + 200
	if X <= Y <= max_num:
		print('YES')
	else:
		print('NO')


def is_following_practice(X, Y):
	return Y >= X and Y <= X + 200
T = int(input())
for i in range(T):
	(X, Y) = map(int, input().split())
	if is_following_practice(X, Y):
		print('YES')
	else:
		print('NO')


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


for _ in range(int(input())):
	(a, b) = [int(x) for x in input().split()]
	if b > a + 200 or b < a:
		print('NO')
	else:
		print('YES')


T = int(input())
for i in range(0, T):
	(X, Y) = input().split()
	x = int(X)
	y = int(Y)
	d = x + 201
	if y in range(x, d):
		print('YES')
	else:
		print('NO')


n = int(input())
for i in range(n):
	(n1, n2) = map(int, input().split())
	if n2 <= n1 + 200 and n2 >= n1:
		print('YES')
	else:
		print('NO')


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