There is an $N$ by $M$ grid. A thief is trying to escape from a policeman. The thief is currently in cell $(x,y)$ in the grid, while the policeman is in cell $(a,b)$. Cells are numbered from $1$ to $N$, top to bottom, and $1$ to $M$, left to right. Both of them are at different cells initially.

Both of them take turns alternatively. First it is the thief's turn, then the police's, and so on. The thief needs to reach the cell $(N,M)$ to escape. In his turn, the thief can move either right, or down, from his current cell. In other words, if his current cell is $(i,j)$, then in one turn, he can either go to cell $(i,j+1)$ or the cell $(i+1,j)$. He can't stop, i.e., he needs to move during each of his turns. The policeman can move right, down, or (right $+$ down) in one turn. In other words, in one turn, if his current cell is $(i,j)$, then he can go to the cell $(i,j+1)$, the cell $(i+1,j)$ or the cell $(i+1,j+1)$. It is not compulsory for the policeman to move every turn, i.e., he can choose to stay in his current cell in a particular turn of his. Neither of them are in cell $(N,M)$ at the start.

The policeman catches the thief if he's in the same cell as the thief at any point of time, and he had reached that cell before the thief. If the thief reaches the cell $(N,M)$ before the policeman, then he shall escape. Find if the thief shall escape, or the policeman shall catch him, if both of them move optimally, and if both of them have perfect knowledge of the other person's location at all times. Print YES if the thief shall escape, else print NO if the policeman shall catch him.

------  Input: ------
The first line contains an integer $T$, denoting the number of test cases.
The first line of each test case contains two space-separated integers $N$ and $M$, denoting the number of rows and columns in the grid, respectively. 
The second line of each test case contains two space-separated integers $x$ and $y$, denoting the coordinates of the cell that the thief is in, initially.
The third line of each test case contains two space-separated integers $a$ and $b$, denoting the coordinates of the cell that the policeman is in, initially.

------ Output: ------

For each test case print YES if the thief shall escape, else print NO, in a separate line.

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

------ Constraints  ------
$1 ≤ T ≤ 10^{5}$
$3 ≤ N, M ≤ 10^{5}$
$1 ≤ x, a ≤ N$
$1 ≤ y, b ≤ M$
Both of them are in different cells initially.
Neither of them are in cell $(N,M)$ initially.
The thief needs to move during every turn of his. The policeman can choose not to move.

----- Sample Input 1 ------ 
3

3 3

2 3

3 1

3 3

2 3

3 2

5 4

1 2

4 2
----- Sample Output 1 ------ 
YES

YES

NO
----- explanation 1 ------ 
- Sample Test $1$: It's the thief's turn first. In his turn, he simply moves from his current cell, $(2,3)$ to the escape cell $(3,3)$ and escapes successfully. 

- Sample Test $2$: Similar to the previous test case, the thief reaches the escape cell in his turn. The policeman too reaches the escape cell $(3,3)$ from his cell $(3,2)$ in his turn, but since the thief had already reached it in his turn, he manages to escape successfully.

- Sample Test $3$: The thief is initially at $(1, 2)$, and needs to reach $(5, 4)$. The police is initially at $(4, 2)$. So initially, both of them are in the second column. The police waits at $(4, 2)$ as long as the thief is in the second column. So he will either catch the thief at the cell $(4, 2)$, or the thief moves to the third column at some point. And when he does so, the police moves to $(4, 3)$ in his next turn, and waits there till the thief moves to the fourth column. So, similar to the previous situation, the police will either catch the thief at the cell $(4, 3)$, or the thief moves to the fourth column. And when the thief moves to the fourth column, the police moves to the cell $(4, 4)$ and waits there, and will eventually catch the thief.
Thus, the thief can't escape.

Source: codechef | Difficulty: MEDIUM_HARD
Tags: Constructive algorithms


Solutions:
for i in range(int(input())):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	if min(n - a + (m - b), max(n - a, m - b)) >= n - x + (m - y):
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	tdist = n - x + (m - y)
	pdist = min(n - a + (m - b), max(n - a, m - b))
	if pdist < tdist:
		print('NO')
	else:
		print('YES')


for _ in range(int(input())):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	val = n - x + (m - y)
	ll = max(n - a, m - b)
	if ll < val:
		print('NO')
	else:
		print('YES')


T = int(input())
for i in range(T):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	z = max(n - a, m - b)
	k = n - x + m - y
	if z < k:
		print('NO')
	else:
		print('YES')


t = int(input())
for _ in range(t):
	(n, m) = map(int, input().split())
	(a, b) = map(int, input().split())
	(x, y) = map(int, input().split())
	ans1 = n - a + m - b
	ans2 = max(n - x, m - y)
	if ans1 <= ans2:
		print('YES')
	else:
		print('NO')


def li():
	return list(map(int, input().split()))

def si():
	return input().split()

def ii():
	return int(input())

def ip():
	return input()
for tastcas in range(int(input())):
	(n, m) = li()
	(x, y) = li()
	(a, b) = li()
	td = n - x + (m - y)
	pd = max(n - a, m - b)
	if td <= pd:
		print('YES')
	else:
		print('NO')


from sys import stdin, stdout
input = stdin.readline
t = int(input().strip())
for _ in range(t):
	(n, m) = list(map(int, input().strip().split()))
	(x, y) = list(map(int, input().strip().split()))
	(a, b) = list(map(int, input().strip().split()))
	count2 = min(n - a, m - b)
	(a, b) = (count2 + a, count2 + b)
	count2 += n - a + m - b
	count1 = n - x + m - y
	if count2 >= count1:
		print('YES')
	else:
		print('NO')


import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	thief = n - x + m - y
	police = n - a + m - b - min(n - a, m - b)
	if thief <= police:
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	(n, m) = map(int, input().split())
	(tx, ty) = map(int, input().split())
	(px, py) = map(int, input().split())
	psteps = max(n - px, m - py)
	tsteps = n - tx + m - ty
	if tsteps <= psteps:
		print('YES')
	else:
		print('NO')


t = int(input())
for i in range(t):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	s = n - x + m - y
	p = min(n - a, m - b)
	a += p
	b += p
	p += n - a + m - b
	print('YES' if s <= p else 'NO')


t = int(input())
while t:
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	thief = n - x + m - y
	police = min(n - a, m - b)
	a += police
	b += police
	police += n - a + m - b
	if thief <= police:
		print('YES')
	else:
		print('NO')
	t -= 1


for _ in range(int(input())):
	(n, m) = list(map(int, input().split()))
	(x, y) = list(map(int, input().split()))
	(a, b) = list(map(int, input().split()))
	c = n - x + m - y
	d = n - a + m - b - min(n - a, m - b)
	if c <= d:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	tstep = n - x + m - y
	if tstep == 1:
		print('YES')
	else:
		c = n - a
		d = m - b
		pstep = max(c, d)
		if pstep < tstep:
			print('NO')
		else:
			print('YES')


for i in range(int(input())):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	(p, c) = (0, 0)
	c = n - x + (m - y)
	p = n - a + (m - b) - min(n - a, m - b)
	if c <= p:
		print('YES')
	elif p < c:
		print('NO')


T = int(input())
ans = []
for _ in range(T):
	(N, M) = [int(i) for i in input().split()]
	(x, y) = [int(i) for i in input().split()]
	(a, b) = [int(i) for i in input().split()]
	police = max(N - a, M - b)
	theif = N - x + M - y
	if theif <= police:
		ans.append('YES')
	else:
		ans.append('NO')
for i in ans:
	print(i)


T = int(input())
for _ in range(T):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	theif = n - x + m - y
	police = n - a + m - b - min(n - a, m - b)
	if theif <= police:
		print('YES')
	else:
		print('NO')


for i in range(int(input())):
	(n, m) = [int(x) for x in input().split()]
	(x, y) = [int(x) for x in input().split()]
	(a, b) = [int(x) for x in input().split()]
	dist1 = max(n - a, m - b)
	dist2 = int(n - x + (m - y))
	if dist1 < dist2:
		print('NO')
	else:
		print('YES')


for i in range(int(input())):
	(N, M) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	thief = N + M - x - y
	police = min(N - a, M - b)
	a = a + police
	b = b + police
	police = police + N + M - a - b
	if thief <= police:
		print('YES')
	else:
		print('NO')


for __ in range(int(input())):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	time_taken_by_thief = n - x + m - y
	time_taken_by_cop = max(n - a, m - b)
	if time_taken_by_cop < time_taken_by_thief:
		print('NO')
	else:
		print('YES')


def tdis(xi, yi, xf, yf):
	return xf - xi + yf - yi

def pdis(xi, yi, xf, yf):
	m = min(yf - yi, xf - xi)
	return m + tdis(xi + m, yi + m, xf, yf)
for _ in range(int(input())):
	(n, m) = map(int, input().split())
	(tx, ty) = map(int, input().split())
	(px, py) = map(int, input().split())
	td = tdis(tx, ty, n, m)
	pd = pdis(px, py, n, m)
	print('YES' if td - 1 < pd else 'NO')


import sys
MOD = 1000000007
inp = sys.stdin.readline

def ii():
	return int(inp())

def iis():
	return [int(i) for i in inp().split()]
t = ii()
for _ in range(t):
	(n, m) = iis()
	(x, y) = iis()
	(a, b) = iis()
	print('YES' if max(n - a, m - b) >= n - x + m - y else 'NO')


def solve():
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	dt = n - x + (m - y)
	dp = 0
	t = min(n - a, m - b)
	dp += t
	a += t
	b += t
	if a < n:
		dp += n - a
	if b < m:
		dp += m - b
	if dp < dt:
		print('NO')
		return
	print('YES')
try:
	t = int(input())
	for i in range(t):
		solve()
except:
	pass


q = int(input())
while q:
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	tt = n - x + (m - y)
	tp = max(n - a, m - b)
	if tp < tt:
		print('NO')
	else:
		print('YES')
	q -= 1


T = int(input())
for i in range(T):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	Tth = n - x + (m - y)
	px = n - a
	py = m - b
	Tpl = max(px, py)
	if Tth <= Tpl:
		print('YES')
	elif Tth > Tpl:
		print('NO')


for _ in range(int(input())):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	ts = n - x + (m - y)
	if n == a or m == b:
		ps = n - a + (m - b)
	else:
		p1 = min(n - a, m - b)
		a += p1
		b += p1
		ps = n - a + (m - b) + p1
	print('YES' if ts <= ps else 'NO')


t = int(input())
for _ in range(t):
	(N, M) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	if N - x + M - y > max(N - a, M - b):
		print('NO')
	else:
		print('YES')


for i in range(int(input())):
	l = list(map(int, input().split()))
	a = list(map(int, input().split()))
	b = list(map(int, input().split()))
	t = l[0] - a[0] + l[1] - a[1]
	p = max(l[0] - b[0], l[1] - b[1])
	if t <= p:
		print('YES')
	else:
		print('NO')


ni = int(input())
ii = 0
li = []
while ii < ni:
	nm = input().split()
	n = int(nm[0])
	m = int(nm[1])
	xy = input().split()
	x = int(xy[0])
	y = int(xy[1])
	ab = input().split()
	a = int(ab[0])
	b = int(ab[1])
	thi = n - x + (m - y)
	u = n - a
	v = m - b
	pol = max(u, v)
	if thi <= pol:
		li.append('YES')
	else:
		li.append('NO')
	ii += 1
for r in li:
	print(r)


t = int(input())
while t:
	t -= 1
	(n, m) = [int(x) for x in input().split()]
	(tx, ty) = [int(x) for x in input().split()]
	(px, py) = [int(x) for x in input().split()]
	if max(n - px, m - py) < n - tx + m - ty:
		print('NO')
	else:
		print('YES')


t = int(input())
for _ in range(0, t):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	th_min = n - x + (m - y)
	p_min = max(n - a, m - b)
	if p_min < th_min:
		print('NO')
	elif p_min >= th_min:
		print('YES')


for j in range(int(input())):
	(n, m) = list(map(int, input().split()))
	(x, y) = list(map(int, input().split()))
	(a, b) = list(map(int, input().split()))
	print('YES') if n - x + m - y <= max(n - a, m - b) else print('NO')


for _ in range(int(input())):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	police_dist = max(n - a, m - b)
	thief_dist = n - x + (m - y)
	if thief_dist <= police_dist:
		print('YES')
	else:
		print('NO')


from sys import stdin

def solve():
	(n, m) = map(int, stdin.readline().split())
	(x, y) = map(int, stdin.readline().split())
	(a, b) = map(int, stdin.readline().split())
	thief = n - x + (m - y)
	police = max(n - a, m - b)
	if thief <= police:
		print('YES')
	else:
		print('NO')
t = int(stdin.readline())
while t:
	solve()
	t -= 1


from sys import stdin
for _ in range(int(stdin.readline())):
	(n, m) = map(int, stdin.readline().split())
	(x, y) = map(int, stdin.readline().split())
	(a, b) = map(int, stdin.readline().split())
	thief = n - x + m - y
	if thief == 1:
		print('YES')
		continue
	police = max(n - a, m - b)
	if thief <= police:
		print('YES')
	else:
		print('NO')


def escape(n, m, x, y):
	return n - x + m - y

def catch(n, m, a, b):
	return max(n - a, m - b)
for _ in range(int(input())):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	t_step = escape(n, m, x, y)
	p_step = catch(n, m, a, b)
	if x == a and y == b:
		print('NO')
	elif t_step <= p_step:
		print('YES')
	else:
		print('NO')


t = int(input())
while t:
	t -= 1
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	thief_steps = n - x + (m - y)
	police_steps = max(n - a, m - b)
	if thief_steps <= police_steps:
		print('YES')
	else:
		print('NO')


t = int(input().rstrip())
for _ in range(t):
	(n, m) = list(map(int, input().rstrip().split(' ')))
	(a, b) = list(map(int, input().rstrip().split(' ')))
	(x, y) = list(map(int, input().rstrip().split(' ')))
	t = n + m - (a + b)
	if t == 1:
		print('YES')
	else:
		r1 = n - x
		r2 = m - y
		p = max([r1, r2])
		if p < t:
			print('NO')
		else:
			print('YES')


T = int(input().strip())
for _ in range(T):
	(N, M) = map(int, input().strip().split())
	(x, y) = map(int, input().strip().split())
	(a, b) = map(int, input().strip().split())
	t1 = N - x + (M - y)
	if N - a > M - b:
		(N, M, a, b) = (M, N, b, a)
	t2 = N - a + (M - (b + N - a))
	if t1 <= t2:
		print('YES')
	else:
		print('NO')


def police(N, M, x, y, a, b):
	dp_v = N - a
	dp_h = M - b
	dt_v = N - x
	dt_h = M - y
	dp = max(dp_v, dp_h)
	dt = dt_v + dt_h
	if dp < dt:
		return 'NO'
	else:
		return 'YES'
T = int(input())
for i in range(T):
	(N, M) = list(map(int, input().split()))
	(x, y) = list(map(int, input().split()))
	(a, b) = list(map(int, input().split()))
	print(police(N, M, x, y, a, b))


for _ in range(int(input())):
	(n, m) = list(map(int, input().split()))
	(x, y) = list(map(int, input().split()))
	(a, b) = list(map(int, input().split()))
	t = n + m - (x + y)
	if t == 1:
		print('YES')
	else:
		c = n - a
		d = m - b
		e = max(c, d)
		if e < t:
			print('NO')
		else:
			print('Yes')


try:
	t = int(input())
	for i in range(t):
		(n, m) = list(map(int, input().split()))
		(x, y) = list(map(int, input().split()))
		(a, b) = list(map(int, input().split()))
		if n - x + m - y <= max(n - a, m - b):
			print('YES')
		else:
			print('NO')
except:
	pass


def predict(n, m, x, y, a, b):
	robber_moves = n - x + (m - y)
	police_moves = max(n - a, m - b)
	if robber_moves <= police_moves:
		return 'YES'
	else:
		return 'NO'
T = int(input())
for _ in range(T):
	(n, m) = list(map(int, input().split()))
	(x, y) = list(map(int, input().split()))
	(a, b) = list(map(int, input().split()))
	result = predict(n, m, x, y, a, b)
	print(result)


for _ in range(int(input())):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	k1 = n - x + m - y
	r = n - a
	u = m - b
	p = max(r, u)
	if k1 == 1:
		print('YES')
	elif p < k1:
		print('NO')
	else:
		print('YES')


try:
	for _ in range(int(input())):
		(N, M) = map(int, input().split())
		(x, y) = map(int, input().split())
		(a, b) = map(int, input().split())
		x1 = N - x + M - y
		x2 = N - a + M - b - min(N - a, M - b)
		if x2 >= x1:
			print('YES')
		else:
			print('NO')
except:
	pass


for i in range(int(input())):
	(N, M) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	dt = N - x + (M - y)
	dp = max(N - a, M - b)
	if dt > dp:
		print('NO')
	else:
		print('YES')


for __ in range(int(input())):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	cnt = n - x + (m - y)
	uv = m - b
	cnt2 = max(n - a, m - b)
	if cnt2 < cnt:
		print('NO')
	else:
		print('YES')


T = int(input())
for i in range(T):
	N_M = input().split()
	(N, M) = (int(N_M[0]), int(N_M[1]))
	X_Y = input().split()
	(X, Y) = (int(X_Y[0]), int(X_Y[1]))
	A_B = input().split()
	(A, B) = (int(A_B[0]), int(A_B[1]))
	t = N + M - X - Y
	p = max(N - A, M - B)
	if t <= p:
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	(N, M) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	theif = N - x + M - y
	police = N - a + M - b - min(M - b, N - a)
	print('YES') if theif <= police else print('NO')


try:
	t = int(input())
	for _ in range(t):
		(n, m) = map(int, input().split())
		(x, y) = map(int, input().split())
		(a, b) = map(int, input().split())
		tt = n - x + (m - y)
		pt = max(n - a, m - b)
		if pt >= tt:
			print('YES')
		else:
			print('NO')
except:
	pass


t = int(input())
for _ in range(t):
	(n, m) = map(int, input().split(' '))
	(x, y) = map(int, input().split(' '))
	(a, b) = map(int, input().split(' '))
	d1 = n - x + (m - y)
	d2 = max(n - a, m - b)
	if d1 <= d2:
		print('YES')
	else:
		print('NO')


T = int(input())
for i in range(T):
	(N, M) = input().split()
	(N, M) = [int(N), int(M)]
	(x, y) = input().split()
	(x, y) = [int(x), int(y)]
	(a, b) = input().split()
	(a, b) = [int(a), int(b)]
	if N - x + M - y <= N - a + M - b - min(N - a, M - b):
		print('YES')
	else:
		print('NO')


for _ in range(int(input())):
	(N, M) = [int(i) for i in input().split()]
	(x, y) = [int(i) for i in input().split()]
	(a, b) = [int(i) for i in input().split()]
	thief = N - x + (M - y)
	police = max(N - a, M - b)
	if thief <= police:
		print('YES')
	else:
		print('NO')


try:
	t = int(input())
	theif = 0
	police = 0
	while t:
		(n, m) = map(int, input().split())
		(x, y) = map(int, input().split())
		(xp, yp) = map(int, input().split())
		out_1 = n - x
		out_2 = m - y
		theif = out_1 + out_2
		out_3 = n - xp
		out_4 = m - yp
		police = out_3 + out_4 - min(out_3, out_4)
		if theif <= police:
			print('YES')
		else:
			print('NO')
		t = t - 1
except:
	pass


for _ in range(int(input())):
	(m, n) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	k = m - x + n - y
	p = m - a + n - b - min(m - a, n - b)
	print('YES') if k <= p else print('NO')


t = int(input())
while t:
	(m, n) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	k = m - x + n - y
	p = m - a + n - b - min(m - a, n - b)
	if k <= p:
		print('YES')
	else:
		print('NO')
	t = t - 1


import math
import sys
try:
	t = int(input())
	for i in range(t):
		(x, y) = [int(x) for x in input().split()]
		(x1, y1) = [int(x) for x in input().split()]
		(x2, y2) = [int(x) for x in input().split()]
		tmax = x - x1 + y - y1
		pmax = max(x - x2, y - y2)
		if tmax - 1 >= pmax:
			print('NO')
		else:
			print('YES')
except:
	pass


t = int(input())
for i in range(t):
	arr_1 = tuple(map(int, input().rstrip().split()))
	arr_2 = tuple(map(int, input().rstrip().split()))
	arr_3 = tuple(map(int, input().rstrip().split()))
	tm = abs(arr_1[0] - arr_2[0] + arr_1[1] - arr_2[1])
	pm = max(arr_1[0] - arr_3[0], arr_1[1] - arr_3[1])
	if tm > pm:
		print('NO')
	elif pm > tm or pm == tm:
		print('YES')


t = int(input())
for i in range(t):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	thief = n - x + m - y
	police = max(n - a, m - b)
	if thief <= police:
		print('YES')
	else:
		print('NO')


t = int(input())
for _ in range(t):
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	thief = n - x + (m - y)
	police = min(n - a, m - b)
	d = n - a - police + m - b - police
	police += d
	if thief > police:
		print('NO')
	else:
		print('YES')


T = int(input())
t = 1
while t <= T:
	(n, m) = map(int, input().split())
	(x, y) = map(int, input().split())
	(a, b) = map(int, input().split())
	dist = n - x + m - y
	police = max(n - a, m - b)
	if dist <= police:
		print('YES')
	else:
		print('NO')
	t += 1