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: // package com.company
  
  /*
   * @author :: Yuvraj Singh
   * CS UNDERGRAD AT IT GGV BILASPUR
   */
  
  import java.io.BufferedReader;
  import java.io.InputStreamReader;
  import java.util.*;
  
  import static java.lang.Math.max;
  import static java.lang.System.out;
  
  public final class Main {
      // Solution here
  
      void solve(){
          long a= in.nextLong();
          long b= in.nextLong();
          long c= in.nextLong();
          long m= in.nextLong();
          ArrayList<Long> arr= new ArrayList<>();
          arr.add(a);
          arr.add(b);
          arr.add(c);
          Collections.sort(arr);
          Collections.reverse(arr);
          long mn=(2*arr.get(0)-(a+b+c)-1);
          mn=max(mn,0L);
          long mx=a+b+c-3;
          if(m >= mn && m<= mx)
              sb.append("YES").append("\n");
          else
              sb.append("NO").append("\n");
      }
  
  
  
      // Starter Code
      FastReader in;
      StringBuffer sb;
      public static void main(String[] args) {
          new Main().run();
      }
      void run(){
          in= new FastReader();
          start();
      }
      void start(){
          sb= new StringBuffer();
          for(int t=in.nextInt();t>0;t--) {
              solve();
          }
          out.print(sb);
      }
  
      // Useful Functions
      void swap( int i , int j) {
          int tmp  = i;
          i = j;
          j = tmp;
      }
      long power(long x, long y, long p) {
          long res = 1;
          x = x % p;
          while (y > 0) {
              if (y % 2 == 1)
                  res = (res * x) % p;
  
              y = y >> 1;
              x = (x * x) % p;
          }
          return res;
      }
      int upper_bound(long[] arr, int key) {
          int i=0, j=arr.length-1;
          if (arr[j]<=key) return j+1;
          if(arr[i]>key) return i;
          while (i<j){
              int mid= (i+j)/2;
              if(arr[mid]<=key){
                  i= mid+1;
              }else{
                  j=mid;
              }
          }
          return i;
      }
      void sort(long[] A){
          int n = A.length;
          Random rnd = new Random();
          for(int i=0; i<n; ++i){
              long tmp = A[i];
              int randomPos = i + rnd.nextInt(n-i);
              A[i] = A[randomPos];
              A[randomPos] = tmp;
          }
          Arrays.sort(A);
      }
      int[] intArr(int n){
          int[] res= new int[n];
          for(int i=0;i<n;i++){
              res[i]= in.nextInt();
          }
          return res;
      }
      long[] longArr(int n){
          long[] res= new long[n];
          for(int i=0;i<n;i++){
              res[i]= in.nextLong();
          }
          return res;
      }
      //    // sieve of eratosthenes code for precomputing whether numbers are prime or not up to MAX_VALUE
  //    long MAX= MAX_VALUE;
  //    int[] precomp= new int[(int) (MAX+1)];
  //    void sieve(){
  //        long n= MAX;
  //        boolean[] prime = new boolean[(int) (n+1)];
  //        for(int i=0;i<=n;i++)
  //            prime[i] = true;
  //
  //        for(long p = 2; p*p <=n; p++)
  //        {
  //            // If prime[p] is not changed, then it is a prime
  //            if(prime[(int) p])
  //            {
  //                // Update all multiples of p
  //                for(long i = p*p; i <= n; i += p)
  //                    prime[(int) i] = false;
  //            }
  //        }
  //
  //        // Print all prime numbers
  //        for(long i = 2; i <= n; i++)
  //        {
  //            if(prime[(int) i])
  //                precomp[(int) i]= 1;
  //        }
  //    }
      boolean isDigitSumPalindrome(long N) {
          // code here
          long sum= sumOfDigits(String.valueOf(N));
          long rev=0;
          long org= sum;
          while (sum!=0){
              long d= sum%10;
              rev = rev*10 +d;
              sum /= 10;
          }
          return org == rev;
      }
      long sumOfDigits(String n){
          long sum= 0;
          for (char c: n.toCharArray()){
              sum += Integer.parseInt(String.valueOf(c));
          }
          return sum;
      }
      long[] revArray(long[] arr) {
          int n= arr.length;
          int i=0, j=n-1;
          while (i<j){
              long temp= arr[i];
              arr[i]= arr[j];
              arr[j]= temp;
              i++;
              j--;
          }
          return arr;
      }
      long gcd(long a, long b){
          if (b==0)
              return a;
          return gcd(b, a%b);
      }
      long lcm(long a,long b){
          return (a*b)/gcd(a,b);
      }
      static class Pair{
          long first;
          long second;
          Pair(long x, long y){
              this.first=x;
              this.second=y;
          }
      }
      //    static class Compare {
  //        static void compare(ArrayList<Pair> arr, int n) {
  //            arr.sort(new Comparator<Pair>() {
  //                @Override
  //                public int compare(Pair p1, Pair p2) {
  //                    return (int) (p2.first - p1.first);
  //                }
  //            });
  //        }
  //    }
      public static class FastReader{
          BufferedReader br;
          StringTokenizer st;
          public FastReader(){
              br=new BufferedReader(new InputStreamReader(System.in));
          }
          String next(){
              while (st==null || !st.hasMoreElements()){
                  try{
                      st=new StringTokenizer(br.readLine());
                  }catch (Exception e){
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
          int nextInt(){
              return Integer.parseInt(next());
          }
          long nextLong(){
              return Long.parseLong(next());
          }
          double nextDouble(){
              return Double.parseDouble(next());
          }
          float nextFloat(){
              return Float.parseFloat(next());
          }
          String nextLine(){
              String str="";
              try{
                  str=br.readLine();
              }catch (Exception e){
                  e.printStackTrace();
              }
              return str;
          }
      }
  }