Anna is a girl so brave that she is loved by everyone in the city and citizens love her cookies. She is planning to hold a party with cookies. Now she has $a$ vanilla cookies and $b$ chocolate cookies for the party.

She invited $n$ guests of the first type and $m$ guests of the second type to the party. They will come to the party in some order. After coming to the party, each guest will choose the type of cookie (vanilla or chocolate) to eat. There is a difference in the way how they choose that type:

If there are $v$ vanilla cookies and $c$ chocolate cookies at the moment, when the guest comes, then  if the guest of the first type: if $v>c$ the guest selects a vanilla cookie. Otherwise, the guest selects a chocolate cookie.  if the guest of the second type: if $v>c$ the guest selects a chocolate cookie. Otherwise, the guest selects a vanilla cookie. 

After that:  If there is at least one cookie of the selected type, the guest eats one.  Otherwise (there are no cookies of the selected type), the guest gets angry and returns to home. 

Anna wants to know if there exists some order of guests, such that no one guest gets angry. Your task is to answer her question.


-----Input-----

The input consists of multiple test cases. The first line contains a single integer $t$ ($1 \le t \le 1000$) — the number of test cases. Next $t$ lines contain descriptions of test cases.

For each test case, the only line contains four integers $a$, $b$, $n$, $m$ ($0 \le a,b,n,m \le 10^{18}, n+m \neq 0$).


-----Output-----

For each test case, print the answer in one line. If there exists at least one valid order, print "Yes". Otherwise, print "No".

You can print each letter in any case (upper or lower).


-----Example-----
Input
6
2 2 1 2
0 100 0 1
12 13 25 1
27 83 14 25
0 0 1 0
1000000000000000000 1000000000000000000 1000000000000000000 1000000000000000000

Output
Yes
No
No
Yes
No
Yes



-----Note-----

In the first test case, let's consider the order $\{1, 2, 2\}$ of types of guests. Then:  The first guest eats a chocolate cookie. After that, there are $2$ vanilla cookies and $1$ chocolate cookie.  The second guest eats a chocolate cookie. After that, there are $2$ vanilla cookies and $0$ chocolate cookies.  The last guest selects a chocolate cookie, but there are no chocolate cookies. So, the guest gets angry. 

So, this order can't be chosen by Anna.

Let's consider the order $\{2, 2, 1\}$ of types of guests. Then:  The first guest eats a vanilla cookie. After that, there is $1$ vanilla cookie and $2$ chocolate cookies.  The second guest eats a vanilla cookie. After that, there are $0$ vanilla cookies and $2$ chocolate cookies.  The last guest eats a chocolate cookie. After that, there are $0$ vanilla cookies and $1$ chocolate cookie. 

So, the answer to this test case is "Yes".

In the fifth test case, it is illustrated, that the number of cookies ($a + b$) can be equal to zero, but the number of guests ($n + m$) can't be equal to zero.

In the sixth test case, be careful about the overflow of $32$-bit integer type.

Difficulty: interview

Starter code:

Solutions:
t=int(input())
for x in range(t):
    a,b,n,m= map(int,input().split(" "))
    if a+b<n+m:
        print("No")
    else:
        if m>min(a,b):
            print("No")
        else:
            print("Yes")

t = int(input())
for _ in range(t):
    a, b, n, m = list(map(int, input().split()))
    if min(a, b) >= m and (a + b) >= n + m:
        print("Yes")
    else:
        print("No")


from math import *

def r1(t):
    return t(input())

def r2(t):
    return [t(i) for i in input().split()]

for _ in range(r1(int)):
    a, b, n, m = r2(int)
    if n + m > a + b or m > min(a, b):
        print('No')
    else:
        print('Yes')


for _ in range(int(input())):
    a, b, n, m = list(map(int, input().split()))
    if n+m > a+b or m > min(a, b):
        print("No")
    else:
        print("Yes")


q = int(input())
for _ in range(q):
    o1, o2, t1, t2 = map(int,input().split())
    answer = True
    if t2 > min(o1,o2):
        answer = False
    if t1 + t2 > o1 + o2:
        answer = False
    if answer:
        print("Yes")
    else:
        print("No")

import sys
input=lambda: sys.stdin.readline().rstrip()
t=int(input())
for _ in range(t):
  a,b,n,m=map(int,input().split())
  if a+b<n+m:
    print("No")
  elif m>min(a,b):
    print("No")
  else:
    print("Yes")

# https://codeforces.com/contest/1371/problem/C
import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__
# do magic here
t = int(input())
for _ in range(t):
    a, b, n, m = list(map(int, input().split()))
    if a + b < (n+m):
        print("No")
        continue
    if a <= b:
        if a >= m:
            print("Yes")
        else:
            print("No")
    else:
        if b >= m:
            print("Yes")
        else:
            print("No")


test= int(input())
for ii in range(test):
    a,b,n,m= list(map(int,input().split()))
    if(a+b)<(m+n):
        print ("No")
        continue
    if(a>b):
        a,b=b,a
    if(a<m):
        print ("No")
        continue
    rem= a-m
    if(b+rem)<n:
        print ("No")
        continue
    print ("Yes")
    
   
  
    


mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    for _ in range(int(input())):
        A, B, N, M = list(map(int, input().split()))
        if A+B < N+M:
            print("No")
        else:
            mi = min(A, B)
            if mi < M:
                print("No")
            else:
                print("Yes")


def __starting_point():
    main()

__starting_point()

for nt in range(int(input())):
	a,b,n,m = map(int,input().split())
	if n+m>a+b:
		print ("No")
		continue
	if m>min(a,b):
		print ("No")
		continue
	print ("Yes")

t=int(input())
for _ in range(t):
  a,b,n,m=map(int,input().split())
  if n+m>a+b:
    print('No')
    continue
  if min(a,b)<m:
    print('No')
    continue
  print('Yes')

import sys
lines = sys.stdin.readlines()
T = int(lines[0].strip())
# (N, K) = map(int, lines[0].strip().split(" "))
for t in range(T):
    (a, b, n, m) = map(int, lines[t+1].strip().split(" "))
    res = True
    if n + m > a + b: res = False
    elif m > min(a, b): res = False
    if res: print("Yes")
    else: print("No")

t=int(input())
for _ in range(t):
    a,b,n,m=map(int,input().split(" "))
    if n+m<=a+b and min(a,b)>=m:
        print("Yes")
    else:
        print("No")

t= int(input())
for j in range(t):
    a,b,n,m= list(map(int,input().split()))
    if(a+b)<(m+n):
        print ("No")
        continue
    if(a>b):
        a,b=b,a
    while(False):
        break
    if(a<m):
        print ("No")
        continue
    xx= a-m
    if(b+xx)<n:
        print ("No")
        continue
    while(False):
        break
    print ("Yes")
    
   
  
    


tk=int(input())
for i in range (tk):
  a,b,n,m=map(int,input().split())
  if(a+b<n+m):
    print('No')
    continue
  else:
    if(min(a,b)<m):
      print('No')
    else:
      print('Yes')

t=int(input())
for _ in range(t):
    a,b,n,m=map(int,input().split())
    if a+b<n+m or min(a,b)<m:
        print('No')
    else:
        print('Yes')

import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
  a,b,n,m = map(int,input().split())
  if a+b < n+m:
    print("No")
    continue
  if min(a,b) < m:
    print("No")
  else:
    print("Yes")

#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    t = I()
    for _ in range(t):
        a,b,n,m = LI()
        if a+b < n+m:
            print("No")
            continue
        if a <= b:
            a,b = b,a
        r = a-b
        a -= min(n,r)
        n -= min(n,r)
        if a != b:
            if b < m:
                print("No")
            else:
                b -= m
                if n <= a+b:
                    print("Yes")
                else:
                    print("No")
        else:
            r = min(a,b,n,m)
            a -= r
            b -= r
            n -= r
            m -= r
            if a == 0:
                if n == m == 0:
                    print("Yes")
                else:
                    print("No")
            else:
                if m > a:
                    print("No")
                else:
                    print("Yes")
    return

#Solve
def __starting_point():
    solve()

__starting_point()

import sys
input = sys.stdin.readline

t=int(input())
for tests in range(t):
    a,b,n,m=list(map(int,input().split()))

    if min(a,b)>=m and a+b>=n+m:
        print("Yes")
    else:
        print("No")
    


import math
import sys
t = int(input())
for cs in range(t):
    a, b, n, m = list(map(int, input().split()))
    if min(a, b) >= m and a + b >= n + m:
        print('Yes')
    else:
        print('No')