#include <cstdio>
#include <algorithm>
#include <iostream>using namespace std;typedef unsigned long long ll;
ll a[4];
int main(){int test;scanf("%d", &test);while(test --){for(int i = 0; i < 4; i ++)cin >> a[i];sort(a, a+4);bool flag = true;for(int i = 0; i < 4; i ++)if(a[i] == 0){flag = false;break;}if(flag == false || a[3] - a[2] >= a[0] + a[1])puts("No");else puts("Yes");}return 0;
}

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#define maxn 1010
using namespace std;
typedef long long ll;
#define mod 100000007int a[maxn], n;ll ans[maxn], pow2[maxn];int main(){int test;scanf("%d", &test);pow2[0] = 1;for(int i = 1; i <= 1000; i ++)pow2[i] = (pow2[i-1] << 1) % mod;while(test --){scanf("%d", &n);int mx = 0;for(int i = 1; i <= n; i ++)scanf("%d", &a[i]), mx = max(mx, a[i]);sort(a+1, a+1+n);memset(ans, 0, sizeof ans);for(int i = 1; i <= mx; i ++){int cnt = 0;for(int j = 1; j <= n; j ++)cnt += a[j] % i == 0;ans[i] = pow2[cnt] - 1;}for(int i = mx; i; i --)for(int j = i + i; j <= mx; j += i)ans[i] -= ans[j], ans[i] %= mod;ll ret = 0;for(int i = 1; i <= mx; i ++)ret += 1ll * ans[i] * i, ret %= mod;printf("%I64d\n", (ret + mod) % mod);}return 0;
}

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstring>
#define maxn 2010
using namespace std;int n, s[maxn];char str[maxn];struct Node{int fail, nxt[26], len;void clear(){memset(nxt, 0, sizeof nxt);len = fail = 0;}
}st[maxn];int last, size, len;void init(){last = len = 0;st[0].clear(), st[1].clear();st[0].len = 0, st[1].len = -1;st[0].fail = st[1].fail = 1;s[0] = -1; size = 1;
}int get_fail(int x){while(s[len-st[x].len-1] != s[len])x = st[x].fail;return x;
}int sz[maxn];void Extend(int c){s[++ len] = c;int cur = get_fail(last);if(!st[cur].nxt[c]){int now = ++ size;st[now].clear();st[now].len = st[cur].len + 2;st[now].fail = st[get_fail(st[cur].fail)].nxt[c];st[cur].nxt[c] = now;}last = st[cur].nxt[c];
}int ans[maxn][maxn];void solve(){for(int i = 1; i <= n; i ++){init();for(int j = i; j <= n; j ++){Extend(str[j]-'a');ans[i][j] = size - 1;}}
}void read(int& num){char ch = getchar(); num = 0;for(; ch < '!'; ch = getchar());for(; ch > '!'; ch = getchar())num = (num << 1) + (num << 3) + (ch ^ 48);
}int main(){int test;scanf("%d", &test);while(test --){init();scanf("%s", str+1);n = strlen(str+1);solve();int Q, l, r;read(Q);for(int i = 1; i <= Q; i ++){read(l), read(r);printf("%d\n", ans[l][r]);}}return 0;
}