#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

bool solve() {
	int a,b,x,y;
	scanf("%d%d%d%d",&a,&x,&b,&y);
	if (x+y==0) return false;
	if (a==0) return true;
	if (a+b<=2) return true;
	if (b>=a+2) return true;
	if (b==a+1) {
		if (y>0) return true;
		return a==1;
	}
	// a == b
	if (y==0) return false;
	if (x==0) return a==2;
	return a<=3;
	// a 1 a 1
	// a 0 a 1

	return true;
}
int _;
int main() {
	for (scanf("%d",&_);_;_--) {
		puts(solve()?"Yes":"No");
	}
}