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.lang.*;
  import java.io.*;
  public class Main  
  {
      static FastReader sc =new FastReader();
      static int mod=1000000007;
      
         public static void main(String [] args)
      {
          PrintWriter out=new PrintWriter(System.out);
  		StringBuffer sb = new StringBuffer("");
          int test = i();
          while(test-->0)
          {
             long a[] = inputL(3);
             long r = l();
             long min = 0;
             Arrays.sort(a);
             min = max(min,(a[2]-a[1]-a[0])-1 );
             if(a[0]+a[1]+a[2]-3>=r && min<=r)
             {
                 out.println("YES"); 
             }
             else 
             {
                 out.println("NO");
             }
          }
          out.close();
      
  }
      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 (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; 
          } 
      } 
  
      static int i() {
          return sc.nextInt();
      }
  
      static String s() {
          return sc.next();
      }
  
      static long l() {
          return sc.nextLong();
      }
  
      static char[] inputC()
      {
          String s = sc.nextLine();
          return s.toCharArray();
      }
  
      static int[] input(int n) {
          int A[]=new int[n];
             for(int i=0;i<n;i++) {
                 A[i]=sc.nextInt();
             }
          return A;
      }
  
      static long[] inputL(int n) {
          long A[]=new long[n];
             for(int i=0;i<n;i++) {
                 A[i]=sc.nextLong();
             }
             return A;
      }
  
      static long[] putL(long a[]) {
          long A[]=new long[a.length];
             for(int i=0;i<a.length;i++) {
                 A[i]=a[i];
             }
             return A;
      }
  
      static String[] inputS(int n) {
          String A[]=new String[n];
             for(int i=0;i<n;i++) {
                 A[i]=sc.next();
             }
             return A;
      }
      // static List<Integer> sort(List<Integer> list)
      // {
      //     Collections.sort(list);
      //     return list;
      // }
  
      // static List<Integer> sortR(List<Integer> list)
      // {
      //     Collections.sort(list,Collections.reverseOrder());
      //     return list;
      // }
  
      // static List<Long> sort(List<Long> list)
      // {
      //     Collections.sort(list);
      //     return list;
      // }
  
      // static List<Long> sortR(List<Long> list)
      // {
      //     Collections.sort(list,Collections.reverseOrder());
      //     return list;
      // }
  
      // static List<String> sortS(List<String> list)
      // {
      //     Collections.sort(list);
      //     return list;
      // }
  
      // static List<String> sortRS(List<String> list)
      // {
      //     Collections.sort(list,Collections.reverseOrder());
      //     return list;
      // }
  
      static int gcd(int a, int b) 
       { 
           if (a == 0) 
               return b; 
           return gcd(b % a, a); 
       } 
  
       static long gcd(long a, long b) 
       { 
           if (a == 0) 
               return b; 
           return gcd(b % a, a); 
       } 
  
       
      
       static String reverse(String s) {
          StringBuffer p=new StringBuffer(s);
          p.reverse();
          return p.toString();
       }
  
       static int min(int a,int b) {
          return Math.min(a, b);
      }
      static int min(int a,int b,int c) {
          return Math.min(a, Math.min(b, c));
      }
      static int min(int a,int b,int c,int d) {
          return Math.min(a, Math.min(b, Math.min(c, d)));
      }
  
      static int max(int a,int b) {
          return Math.max(a, b);
      }
      static int max(int a,int b,int c) {
          return Math.max(a, Math.max(b, c));
      }
      static int max(int a,int b,int c,int d) {
          return Math.max(a, Math.max(b, Math.max(c, d)));
      }
      static long min(long a,long b) {
          return Math.min(a, b);
      }
      static long min(long a,long b,long c) {
          return Math.min(a, Math.min(b, c));
      }
      static long min(long a,long b,long c,long d) {
          return Math.min(a, Math.min(b, Math.min(c, d)));
      }
      static long max(long a,long b) {
          return Math.max(a, b);
      }
      static long max(long a,long b,long c) {
          return Math.max(a, Math.max(b, c));
      }
      static long max(long a,long b,long c,long d) {
          return Math.max(a, Math.max(b, Math.max(c, d)));
      }
  
      static long sum(int A[]) {
          long sum=0;
          for(int i : A) {
              sum+=i;
          }
          return sum;
      }
  
      static long sum(long A[]) {
          long sum=0;
          for(long i : A) {
              sum+=i;
          }
          return sum;
      }
  
      static void print(int A[]) {
          for(int i : A) {
              System.out.print(i+" ");
          }
          System.out.println();
      }
  
      static void print(long A[]) {
          for(long i : A) {
              System.out.print(i+" ");
          }
          System.out.println();
      }
  
      static long mod(long x) {
            return ((x%mod + mod)%mod);
      }
  
      static long power(long x, long y)
      {
  
  	if(y==0)
  		return 1;
  	if(x==0)
  		return 0;
      long res = 1;
      while (y > 0) {
  
          if (y % 2 == 1)
              res = (res * x) ;
  
          y = y >> 1; 
          x = (x * x);
      }
  
      return res;
      }
  
      static boolean prime(int n) 
  	    { 
  	        if (n <= 1) 
  	            return false; 
  	        if (n <= 3) 
  	            return true; 
  	        if (n % 2 == 0 || n % 3 == 0) 
  	            return false; 
  	        double sq=Math.sqrt(n);
  	  
  	        for (int i = 5; i <= sq; i = i + 6) 
  	            if (n % i == 0 || n % (i + 2) == 0) 
  	                return false; 
  	        return true; 
  	    } 
  
       static boolean prime(long n) 
  	    { 
  	        if (n <= 1) 
  	            return false; 
  	        if (n <= 3) 
  	            return true; 
  	        if (n % 2 == 0 || n % 3 == 0) 
  	            return false; 
  	        double sq=Math.sqrt(n);
  	  
  	        for (int i = 5; i <= sq; i = i + 6) 
  	            if (n % i == 0 || n % (i + 2) == 0) 
  	                return false; 
  	        return true; 
  	    } 
  
      /************************** (for permutation of string )************************/
          // public static TreeSet<String>set=new TreeSet<>();
          // static void permute(String s , String answer)
          // {
          //     if (s.length() == 0)
          //     {
          //         set.add(answer);
          //         return ;
          //     }
              
          //     for(int i = 0 ;i < s.length(); i++)
          //     {
          //         char ch = s.charAt(i);
          //         String left_substr = s.substring(0, i);
          //         String right_substr = s.substring(i + 1);
          //         String rest = left_substr + right_substr;
          //         permute(rest, answer + ch);
          //     }
          // }
      /**************************************************************************/
  
      
  }