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.*;
  import java.util.ArrayList;
  import java.util.Collections;
  import java.util.List;
  import java.util.StringTokenizer;
  
  public class Task {
      FastScanner scanner;
      PrintWriter writer;
  
      public final String INPUT_FILE_NAME = "input.txt";
      public final String OUTPUT_FILE_NAME = "output.txt";
      public final static Double EPS = 0.0000001;
  
      public void run() {
          try {
              writer = new PrintWriter(System.out);//new PrintWriter(new File(OUTPUT_FILE_NAME));
              scanner = new FastScanner(System.in);//new FastScanner(new File(INPUT_FILE_NAME));
  
              solution();
  
              writer.close();
          } catch (IOException e) {
              e.printStackTrace();
          }
      }
  
      class FastScanner {
          BufferedReader reader;
  
          StringTokenizer tokenizer;
          FastScanner(File file) throws FileNotFoundException {
              reader = new BufferedReader(new InputStreamReader(new FileInputStream(file)));
          }
  
          FastScanner(InputStream is) {
              reader = new BufferedReader(new InputStreamReader(is));
          }
  
          boolean hasNext() {
              boolean result = false;
              if (tokenizer != null && tokenizer.hasMoreTokens()) {
                  result =  true;
              } else {
                  String newLine = null;
                  try {
                      newLine = reader.readLine();
                      while(newLine != null) {
                          newLine = newLine.trim();
                          if (!newLine.equals("")) {
                              break;
                          }
                      }
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
  
                  if (newLine != null) {
                      result = true;
                      tokenizer = new StringTokenizer(newLine);
                  }
              }
  
              return result;
          }
  
          String next() {
              hasNext();
              return tokenizer.nextToken();
          }
  
          String nextLine() {
              String result = "";
              try {
                  result = reader.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return result;
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
      }
  
      public int[] readIntArray(int n) {
          int[] result = new int[n];
          for (int i = 0; i < n; ++i) {
              result[i] = scanner.nextInt();
          }
          return result;
      }
  
      public static void main(String[] args) {
          new Task().run();
      }
  
      public void solution() throws IOException {
          int t = scanner.nextInt();
          for (int i = 0; i < t; ++i) {
              solution2();
          }
      }
  
      public void solution2() {
          List<Integer> list = new ArrayList<>();
          for (int i = 0; i < 3; ++i) {
              list.add(scanner.nextInt());
          }
          Collections.sort(list);
          int m = scanner.nextInt();
          int l = lBound(list);
          int r = rBound(list);
          if (l <= m && r >= m) {
              writer.println("YES");
          } else {
              writer.println("NO");
          }
      }
  
      public int lBound(List<Integer> nums) {
          return Math.max(0, nums.get(2) - (nums.get(1) + nums.get(0)) - 1);
      }
  
      public int rBound(List<Integer> nums) {
          int result = 0;
          for (int i = 0; i < nums.size(); ++i) {
              result += nums.get(i);
          }
          result -= 3;
          return result;
      }
  }
  