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.util.*;
  import java.io.*;
  import java.util.stream.*;
  
  public class P2 {
      private static class Pair<K, V>{
          K k;
          V v;
      
          Pair(K k, V v){
              this.k = k;
              this.v = v;
          }
      
          public K getKey() {
              return k;
          }
      
          public V getValue() {
              return v;
          }
      }
      
      private static class Disj{
          private int[] parent;
          private int components;
          Disj(int n){
              parent = new int[n];
              components = n;
              make_set();
          }
      
          private void make_set(){
              for (int i = 0; i < parent.length; i++) {
                  parent[i] = i;
              }
          }
      
          public void union(int a, int b) {
              a = find(a);
              b = find(b);
              if(a != b) {
                  parent[a] = b;
                  components--;
              }
          }
      
          public int find(int x) {
              if(x != parent[x]){
                  parent[x] = find(parent[x]);
              }
      
              return parent[x];
          }
      
          public int getComponentCount() {
              return components;
          }
      }
      
      private static class FastReader {
          private BufferedReader br;
          private StringTokenizer st;
      
          public FastReader()
          {
              br = new BufferedReader(
                  new InputStreamReader(System.in));
          }
      
          public FastReader(String inp) throws FileNotFoundException{
              try{
                  br = new BufferedReader(new FileReader(inp));
              } catch(Exception e){
                  br = new BufferedReader(new InputStreamReader(System.in));
              }
          }
      
          String next()
          {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  }
                  catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
      
          int nextInt() { return Integer.parseInt(next()); }
      
          long nextLong() { return Long.parseLong(next()); }
      
          double nextDouble()
          {
              return Double.parseDouble(next());
          }
      
          String nextLine()
          {
              String str = "";
              try {
                  str = br.readLine();
              }
              catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
  
          int[] nextIntArr(int n){
              int[] arr = new int[n];
              for (int i = 0; i < n; i++) {
                  arr[i] = Integer.parseInt(next());
              }
              return arr;
          }
  
          char[] nextCharArr(int n){
              char[] arr = new char[n];
              for (int i = 0; i < n; i++) {
                  arr[i] = next().charAt(0);
              }
              return arr;
          }
  
          String[] nextStringArr(int n){
              String[] arr = new String[n];
              for (int i = 0; i < n; i++) {
                  arr[i] = next();
              }
              return arr;
          }
      }
      
      private static class Display{
          BufferedWriter bw;
          Display(){
              bw = new BufferedWriter(new OutputStreamWriter(System.out));
          }
  
          public void flushOutput(){
              try {
                  bw.flush();
              } catch (IOException e) {
                  // TODO Auto-generated catch block
                  e.printStackTrace();
              }
          }
  
          public void println(){
              try {
                  bw.write("\n");
              } catch (IOException e) {
                  // TODO Auto-generated catch block
                  e.printStackTrace();
              }
          }
  
          public void println(String output){
              try {
                  bw.write(output + "\n");
              } catch (IOException e) {
                  // TODO Auto-generated catch block
                  e.printStackTrace();
              }
          }
  
          public void println(int output){
              try {
                  bw.write(output + "\n");
              } catch (IOException e) {
                  // TODO Auto-generated catch block
                  e.printStackTrace();
              }
          }
  
          public void println(long output){
              try {
                  bw.write(output + "\n");
              } catch (IOException e) {
                  // TODO Auto-generated catch block
                  e.printStackTrace();
              }
          }
  
          public void println(char output){
              try {
                  bw.write(output + "\n");
              } catch (IOException e) {
                  // TODO Auto-generated catch block
                  e.printStackTrace();
              }
          }
  
          public void print(String output){
              try {
                  bw.write(output);
              } catch (IOException e) {
                  // TODO Auto-generated catch block
                  e.printStackTrace();
              }
          }
  
          public void print(int output){
              try {
                  bw.write(output + "");
              } catch (IOException e) {
                  // TODO Auto-generated catch block
                  e.printStackTrace();
              }
          }
  
          public void print(long output){
              try {
                  bw.write(output + "");
              } catch (IOException e) {
                  // TODO Auto-generated catch block
                  e.printStackTrace();
              }
          }
  
          public void print(char output){
              try {
                  bw.write(output);
              } catch (IOException e) {
                  // TODO Auto-generated catch block
                  e.printStackTrace();
              }
          }
  
          public void printMatrix(int[][] arr){
              for (int i = 0; i < arr.length; i++) {
                  for (int j = 0; j < arr[i].length; j++) {
                      print(arr[i][j] + " ");
                  }
                  println();
              }
          }
      
          public void printMatrix(String[][] arr){
              for (int i = 0; i < arr.length; i++) {
                  for (int j = 0; j < arr[i].length; j++) {
                      print(arr[i][j] + " ");
                  }
                  println();
              }
          }
      
          public void printMatrix(char[][] arr){
              for (int i = 0; i < arr.length; i++) {
                  for (int j = 0; j < arr[i].length; j++) {
                      print(arr[i][j] + " ");
                  }
                  println();
              }
          }
      
          public void printArr(int[] arr){
              for (int i = 0; i < arr.length; i++) {
                  print(arr[i] + " ");
              }
              println();
          }
      
          public void printArr(String[] arr){
              for (int i = 0; i < arr.length; i++) {
                  print(arr[i] + " ");
              }
              println();
          }
      
          public void printArr(char[] arr){
              for (int i = 0; i < arr.length; i++) {
                  print(arr[i] + " ");
              }
              println();
          }
  
          public void printList(List li){
              for (int i = 0; i < li.size(); i++) {
                  print(li.get(i) + " ");
              }
              println();
          }
      }
  
      static class Utils {
          static int mod = (int)1e9 + 7;
          static int[] dir = {0, 1, 0, -1, 0};
          static int[][] dirs = {{1,0},{-1,0},{0,1},{0,-1}};
  
          static long add(long x, long y){
              long res = x + y;
              return (res >= mod ? res - mod : res);
          }
  
          static long mul(long x, long y){
              long res = x * y;
              return (res >= mod ? res % mod : res);
          }
  
          static long sub(long x, long y){
              long res = x - y;
              return (res < 0 ? res + mod : res);
          }
  
          static long pow(long x, long y){
              long res = 1;
              x %= mod;
              while(y > 0){
                  if((y & 1) != 0){
                      mul(res, x);
                      y >>= 1;
                      x = mul(x, x);
                  }
              }
              return res;
          }
  
          static long lcm(long x, long y){
              long res = x / gcd(x, y);
              return res * y;
          }
  
          static long gcd(long x, long y){
              if(x == 0){
                  return y;
              }
              return gcd(y % x, x);
          }
  
          static int add(int x, int y){
              int res = x + y;
              return (res >= mod ? res - mod : res);
          }
  
          static int mul(int x, int y){
              int res = x * y;
              return (res >= mod ? res % mod : res);
          }
  
          static int sub(int x, int y){
              int res = x - y;
              return (res < 0 ? res + mod : res);
          }
  
          static int pow(int x, int y){
              int res = 1;
              x %= mod;
              while(y > 0){
                  if((y & 1) != 0){
                      mul(res, x);
                      y >>= 1;
                      x = mul(x, x);
                  }
              }
              return res;
          }
  
          static int lcm(int x, int y){
              int res = x / gcd(x, y);
              return res * y;
          }
  
          static int gcd(int x, int y){
              if(x == 0){
                  return y;
              }
              return gcd(y % x, x);
          }
      }
  
      private static FastReader r;
      private static Display d;
      public static void main(String[] args) throws FileNotFoundException {
          r = new FastReader("input.txt");
          d = new Display();
  
          int t = r.nextInt();
          while(t-- > 0) {
              solve();
          }
  
          d.flushOutput();
      }
  
      private static void solve(){
          int a = r.nextInt(), b = r.nextInt(), c = r.nextInt();
          int m = r.nextInt();
  
          int maxpairs = a - 1 + b - 1 + c - 1;
          if(maxpairs < m){
              d.println("no");
          } else if(maxpairs == m) {
              d.println("yes");
          } else{
              if(a - 1 - m > b + c){
                  d.println("no");
              } else if(b - 1 - m > c + a){
                  d.println("no");
              } else if(c - 1 - m > a + b){
                  d.println("no");
              } else{
                  d.println("yes");
              }
          }
      }
  }
  
  