#include <stdio.h>
#include <iostream>
#include <algorithm>

using namespace std;

#define SZ(x) ((int)(x).size())
#define PB(x) push_back(x)
#define MEMSET(x,v) memset(x,v,sizeof(x))
#define REP(i,n) for(int (i)=0;(i)<(n);++(i))
#define x first
#define y second
#define INF (0x3f3f3f3f)

typedef long long LL;
typedef pair<int, int> P2;
template<class A, class B> inline bool mina(A &x, B y) {return (x > y)?(x=y,1):0;}
template<class A, class B> inline bool maxa(A &x, B y) {return (x < y)?(x=y,1):0;}

void solve() {
    LL in[4];
    REP(i, 4) {
        cin >> in[i];
    }
    sort(in, in + 4);
    if (in[0] == 0) {
        printf("No\n");
        return ;
    }
    REP(i, 3) {
        in[3] -= in[i];
        if (in[3] < 0) {
            printf("Yes\n");
            return ;
        }
    }
    printf("No\n");
}

int main() {
    int test;
    scanf("%d", &test);
    REP(tt, test) {
        solve();
    }


    return 0;
}