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 java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.*;
  public class Solution{
  static FastScanner sc = new FastScanner();
  public static void solve() {
        int a=sc.nextInt(),b=sc.nextInt(),c=sc.nextInt(),m=sc.nextInt();
        PriorityQueue<Integer> pq=new PriorityQueue<>();
  
       int[] arr = {a, b, c};
        Arrays.sort(arr);
   
      if(m > (a -1 + b - 1 + c - 1))
      {
       System.out.println("NO");
      }
      else
      {
        int k = arr[2] - (arr[1] + arr[0] + 1);
        if (m >= k)
        {
          System.out.println("YES");
        }
        else
        {
         System.out.println("NO");
        }
      }
  
  
        // int n=sc.nextInt();
        // long[] a=sc.readLongArray(n);
        // long sum=0l;
        // for(long i:a)
        //   sum+=i;
        // int m=sc.nextInt();
        // long[] def=new long[m];
        // long[] att=new long[m];
        // for(int i=0;i<m;i++){
        //   def[i]=sc.nextLong();
        //   att[i]=sc.nextLong();
        // }
        // Arrays.sort(a);
  
        // for(int i=0;i<m;i++){
        //     long ans=0l;
        //     int left = 0;
        //     int right = a.length - 1;
        //     int mid = (left + right) / 2;
        //     int i1 = 0;
        //     long target=def[i];
        //     while (left <= right) {
        //       if (a[mid] <= target) {
        //         i1 = mid ;
        //         left = mid + 1;
        //       } else {
        //         right = mid - 1;
        //       }
        //       mid = (left + right) / 2;
        //     }
        //     // if(i1!=0)
        //     // i1--;
        //     if(a[i1]<def[i]){
        //       ans+=def[i]-a[i1];
        //     }
  
        //     if(sum-a[i1]<att[i]){
        //       ans+=att[i]-(sum-a[i1]);
        //     }
        //     System.out.println(ans);
        // }
      }
  public static void main(String[] args) {
    int t = sc.nextInt();
    // int t=1;
    outer: for (int tt = 0; tt < t; tt++) {
      solve();
    }
  
  }
  
  ////////////////////////////////////////////////////////////////////////////////////
  ////////////////////DO NOT READ AFTER THIS LINE //////////////////////////////////
  ////////////////////////////////////////////////////////////////////////////////////
  
  static boolean isPalindrom(char[] arr, int i, int j) {
    boolean ok = true;
    while (i <= j) {
      if (arr[i] != arr[j]) {
        ok = false;
        break;
      }
      i++;
      j--;
    }
    return ok;
  }
  
  static int max(int a, int b) {
    return Math.max(a, b);
  }
  
  static int min(int a, int b) {
    return Math.min(a, b);
  }
  
  static long max(long a, long b) {
    return Math.max(a, b);
  }
  
  static long min(long a, long b) {
    return Math.min(a, b);
  }
  
  static int abs(int a) {
    return Math.abs(a);
  }
  
  static long abs(long a) {
    return Math.abs(a);
  }
  
  static void swap(long arr[], int i, int j) {
    long temp = arr[i];
    arr[i] = arr[j];
    arr[j] = temp;
  }
  
  static void swap(int arr[], int i, int j) {
    int temp = arr[i];
    arr[i] = arr[j];
    arr[j] = temp;
  }
  
  static int maxArr(int arr[]) {
    int maxi = Integer.MIN_VALUE;
    for (int x : arr)
      maxi = max(maxi, x);
    return maxi;
  }
  
  static int minArr(int arr[]) {
    int mini = Integer.MAX_VALUE;
    for (int x : arr)
      mini = min(mini, x);
    return mini;
  }
  
  static long maxArr(long arr[]) {
    long maxi = Long.MIN_VALUE;
    for (long x : arr)
      maxi = max(maxi, x);
    return maxi;
  }
  
  static long minArr(long arr[]) {
    long mini = Long.MAX_VALUE;
    for (long x : arr)
      mini = min(mini, x);
    return mini;
  }
  
  static int gcd(int a, int b) {
    if (b == 0)
      return a;
    return gcd(b, a % b);
  }
  
  static long gcd(long a, long b) {
    if (b == 0)
      return a;
    return gcd(b, a % b);
  }
  
  static void ruffleSort(int[] a) {
    int n = a.length;
    Random r = new Random();
    for (int i = 0; i < a.length; i++) {
      int oi = r.nextInt(n);
      int temp = a[i];
      a[i] = a[oi];
      a[oi] = temp;
    }
    Arrays.sort(a);
  }
  
  public static int binarySearch(int a[], int target) {
    int left = 0;
    int right = a.length - 1;
    int mid = (left + right) / 2;
    int i = 0;
    while (left <= right) {
      if (a[mid] <= target) {
        i = mid + 1;
        left = mid + 1;
      } else {
        right = mid - 1;
      }
      mid = (left + right) / 2;
    }
    return i-1;
  }
  
  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[] readLongArray(int n) {
      long[] a = new long[n];
      for (int i = 0; i < n; i++)
        a[i] = nextLong();
      return a;
    }
  
    int[][] read2dArray(int n, int m) {
      int arr[][] = new int[n][m];
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
          arr[i][j] = nextInt();
        }
      }
      return arr;
    }
  
    ArrayList<Integer> readArrayList(int n) {
      ArrayList<Integer> arr = new ArrayList<Integer>();
      for (int i = 0; i < n; i++) {
        int a = nextInt();
        arr.add(a);
      }
      return arr;
    }
  
    long nextLong() {
      return Long.parseLong(next());
    }
  }
  
  static class pair {
    int fr, sc;
  
    pair(int fr, int sc) {
      this.fr = fr;
      this.sc = sc;
    }
  }
  
  ////////////////////////////////////////////////////////////////////////////////////  
  
  }