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.*;
  
  public class Template {
  
  		public 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 nextLong() {
  				return Long.parseLong(next());
  			}
  		}
  		
  		//prime sieve
  		public static boolean sieve[];
  		public static void sievePrime(int n) {
  			sieve = new boolean[n+1];
  			for(int i=2;i*i<=n;i++) {
  				if(sieve[i] == false) { //means prime hai
  					for(int j=i+i;j<sieve.length;j+= i) {
  						sieve[j] = true;
  					}
  				}
  			}
  			
  		}
  		
  		//swap
  		public static void swap(int a,int b) {
  			int temp= a;
  			a=b;
  			b=temp;
  		}
  		
  		//Longest Palindromic String
  		 public String manacher(String s){
  		        StringBuilder sb = new StringBuilder();
  		        sb.append("@");
  		        for(int i=0;i<s.length();i++){
  		            sb.append("#");
  		            sb.append(s.charAt(i));
  		        }
  		        sb.append("#");
  		        sb.append("$");
  		        String ans = manacher_Util(sb.toString(),s);
  		        return ans;
  		    }
  		    public String manacher_Util(String s,String org){
  		        int lps[] = new int[s.length()];
  		        int c = 0;
  		        int r = 0;
  		        for(int i=1;i<s.length()-1;i++){
  		            int mirror = c - (i-c);
  		            if(i<r){
  		                lps[i] = Math.min(lps[mirror],r-i);
  		            }
  		        
  		            while(s.charAt(1+i+lps[i]) == s.charAt(i-1-lps[i])){
  		                lps[i]++;
  		            }
  		            if(i+lps[i] > r){
  		                c= i ;
  		                r = i+lps[i];
  		            }
  		        }
  		        int maxlen = Integer.MIN_VALUE;
  		        int maxindex = Integer.MIN_VALUE;
  		        for(int i=1;i<lps.length-1;i++){
  		            if(lps[i] > maxlen){
  		                maxlen = lps[i];
  		                maxindex = i;
  		            }
  		        }
  		        int firstindex = maxindex - maxlen + 1;
  		        int actualFirstIndex = (firstindex-2)/2;
  		        return org.substring(actualFirstIndex,actualFirstIndex+maxlen);
  		    }
  		
  		
  		    //kmp
  		    public static int lps[];
  		    public static void kmp(String s) {
  		    	lps = new int[s.length()];
  		    	int i = 1;
  		    	int len = 0;
  		    	while(i<s.length()) {
  		    		if(s.charAt(i) == s.charAt(len)) {
  		    			len++;
  		    			lps[i] = len;
  		    			i++;
  		    		}
  		    		else {
  		    			if(len>0) {
  		    				len = lps[len - 1];
  		    			}
  		    			else {
  		    				lps[i] = 0;
  		    				i++;
  		    			}
  		    		}
  		    	}
  		    }
  
  		public static void main(String[] args) {
  		    FastScanner sc = new FastScanner();
  			int test = sc.nextInt();
  			PrintWriter o = new PrintWriter(System.out);
  		
  			
  			while(test-->0) {
  				int a = sc.nextInt();
  				int b = sc.nextInt();
  				int c = sc.nextInt();
  				int m = sc.nextInt();
  				int max = 0;
  				int min = 0;
  				int x[] = new int[3];
  				x[0] = a;
  				x[1] = b;
  				x[2] = c;
  				Arrays.sort(x);
  				
  				max = a-1 + b-1 + c-1;
  				min = x[2] - x[1] - x[0] - 1;
  				if(m>max)
  				{
  					o.println("NO");
  				}else {
  					if(m>=min)
  					{
  						o.println("Yes");
  					}else {
  						o.println("NO");
  					}
  				}
  				
  				
  		
  			}
  			o.close();
  			
  		}
  		
  		static ArrayList<String> solve(int n)
  		{
  			ArrayList<String> a = new ArrayList<>();
  			int close = n;
  			int open = n;
  			String op = "";
  			r(open,close,op,a);
  			for(int i = 0;i<n;i++)
  			{
  				System.out.println(a.get(i));
  			}
  			return a;
  		}
  		static void r(int open ,int close,String op,ArrayList<String> a)
  		{
  			if(open==0 && close ==0)
  			{
  				a.add(op);
  				return;
  			}
  			
  			if(open!=0)
  			{
  				String op1 = op;
  				op1 = op1 +"(";
  				r(open-1,close,op1,a);
  			}
  			if(close>open)
  			{
  				String op2 = op;
  				op2 = op2 +")";
  				r(open,close-1,op2,a);
  			}
  		}
  		
  		static int gcd(int a, int b)
  	    {
  	      if (b == 0)
  	        return a;
  	      return gcd(b, a % b);
  	    }
  		
  		public static int fac(int n)
  		{
  			int ans = 1;
  			for(int i = 1;i<=n;i++)
  			{
  				ans *= i;
  			}
  			return ans;
  		}
  		
  	}
  
  