description: You are given four integer values a, b, c and m.
  
  Check if there exists a string that contains: 
  
    * a letters 'A'; 
    * b letters 'B'; 
    * c letters 'C'; 
    * no other letters; 
    * exactly m pairs of adjacent equal letters (exactly m such positions i that the i-th letter is equal to the (i+1)-th one). 
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of testcases.
  
  Each of the next t lines contains the description of the testcase — four integers a, b, c and m (1 ≤ a, b, c ≤ 10^8; 0 ≤ m ≤ 10^8).
  
  Output
  
  For each testcase print "YES" if there exists a string that satisfies all the requirements. Print "NO" if there are no such strings.
  
  You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).
  
  Example
  
  Input
  
  
  3
  2 2 1 0
  1 1 1 1
  1 2 3 2
  
  
  Output
  
  
  YES
  NO
  YES
  
  Note
  
  In the first testcase strings "ABCAB" or "BCABA" satisfy the requirements. There exist other possible strings.
  
  In the second testcase there's no way to put adjacent equal letters if there's no letter that appears at least twice.
  
  In the third testcase string "CABBCC" satisfies the requirements. There exist other possible strings.
solution: import javax.swing.*;
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.*;
  
  public class Codeforces {
  
      static FastScanner sc;
      static PrintWriter out;
      static int mod = (int) (1e9+7);
  
      public static void main(String[] args){
          sc = new FastScanner();
          out = new PrintWriter(System.out);
  
          int t = sc.nextInt();
          while(t-- > 0){
              solve();
          }
  
          out.close();
      }
  
      private static void solve() {
  
          int a = sc.nextInt();
          int b = sc.nextInt();
          int c = sc.nextInt();
          int m = sc.nextInt();
  
          int[] arr = new int[]{a, b, c};
          Arrays.sort(arr);
  
          int min = arr[2] - arr[1]-arr[0];
          if(min-1 > m) {
              System.out.println("NO");
              return;
          }
  
          int max = (a-1 >= 0? a-1 : 0) + (b-1 >= 0? b-1 : 0) + (c-1 >= 0? c-1 : 0);
          if(max < m){
              System.out.println("NO");
              return;
          }
          System.out.println("YES");
  
  
      }
  
      public static int nCr(int n, int k) {
          int C[] = new int[k + 1];
  
          // nC0 is 1
          C[0] = 1;
  
          for (int i = 1; i <= n; i++) {
              // Compute next row of pascal
              // triangle using the previous row
              for (int j = Math.min(i, k); j > 0; j--)
                  C[j] = (C[j]%mod + C[j - 1]%mod)%mod;
          }
          return C[k]%mod;
      }
  
      private static int findLcm(int n, int m) {
  
          return n*m/findGcd(Math.min(n, m), Math.max(n, m));
      }
  
      private static int findGcd(int n, int m) {
          if(n == 0)
              return m;
          return findGcd(m%n, n);
      }
  
      private static long findLcm(long n, long m) {
  
          return n*m/findGcd(Math.min(n, m), Math.max(n, m));
      }
  
      private static long findGcd(long n, long m) {
          if(n == 0)
              return m;
          return findGcd(m%n, n);
      }
  
      public static void intSort (int[] arr) {
          //First ruffle
  
          int n = arr.length;
          Random r = new Random();
          for (int i=0; i<arr.length; i++) {
              int j = r.nextInt(n);
              int temp = arr[i];
              arr[i] = arr[j];
              arr[j] = temp;
          }
  
          //then sort
          Arrays.sort(arr);
      }
  
      public static void longSort (long[] arr) {
          //First ruffle
  
          int n = arr.length;
          Random r = new Random();
          for (int i=0; i<arr.length; i++) {
              int j = r.nextInt(n);
              long temp = arr[i];
              arr[i] = arr[j];
              arr[j] = temp;
          }
  
          //then sort
          Arrays.sort(arr);
      }
  
      public static void sort2dArray (long[][] arr) {
          Arrays.sort(arr, (a, b) -> {
              if (a[0] == b[0])
                  return (int) (a[1] - b[1]);
              return (int) (a[0] - b[0]);
          });
  //        Arrays.sort(arr, (a, b) -> {
  //            if (a[1] == b[1])
  //                return (int) (a[0] - b[0]);
  //            return (int) (a[1] - b[1]);
  //        });
      }
  
      public static void sort2dArray (int[][] arr) {
  //        Arrays.sort(arr, (a, b) -> {
  //            if (a[1] == b[1])
  //                return (int) (a[0] - b[0]);
  //            return (int) (a[1] - b[1]);
  //        });
          Arrays.sort(arr, (a, b) -> {
              if (a[0] == b[0])
                  return (int) (a[1] - b[1]);
              return (int) (a[0] - b[0]);
          });
      }
  
      public static class FastScanner {
          BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st=new StringTokenizer("");
          String next() {
              while (!st.hasMoreTokens())
                  try {
                      st=new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              return st.nextToken();
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
          int[] readArray(int n) {
              int[] a=new int[n];
              for (int i=0; i<n; i++) a[i]=nextInt();
              return a;
          }
          long nextLong() {
              return Long.parseLong(next());
          }
      }
  
  }
  
  