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.*;
  public class cp
  {
  	static class Reader {
  		final private int BUFFER_SIZE = 1 << 16;
  		private DataInputStream din;
  		private byte[] buffer;
  		private int bufferPointer, bytesRead;
  
  		public Reader()
  		{
  			din = new DataInputStream(System.in);
  			buffer = new byte[BUFFER_SIZE];
  			bufferPointer = bytesRead = 0;
  		}
  
  		public Reader(String file_name) throws IOException
  		{
  			din = new DataInputStream(
  					new FileInputStream(file_name));
  			buffer = new byte[BUFFER_SIZE];
  			bufferPointer = bytesRead = 0;
  		}
  
  		public String readLine() throws IOException
  		{
  			byte[] buf = new byte[64]; // line length
  			int cnt = 0, c;
  			while ((c = read()) != -1) {
  				if (c == '\n') {
  					if (cnt != 0) {
  						break;
  					}
  					else {
  						continue;
  					}
  				}
  				buf[cnt++] = (byte)c;
  			}
  			return new String(buf, 0, cnt);
  		}
  
  		public int nextInt() throws IOException
  		{
  			int ret = 0;
  			byte c = read();
  			while (c <= ' ') {
  				c = read();
  			}
  			boolean neg = (c == '-');
  			if (neg)
  				c = read();
  			do {
  				ret = ret * 10 + c - '0';
  			} while ((c = read()) >= '0' && c <= '9');
  
  			if (neg)
  				return -ret;
  			return ret;
  		}
  
  		public long nextLong() throws IOException
  		{
  			long ret = 0;
  			byte c = read();
  			while (c <= ' ')
  				c = read();
  			boolean neg = (c == '-');
  			if (neg)
  				c = read();
  			do {
  				ret = ret * 10 + c - '0';
  			} while ((c = read()) >= '0' && c <= '9');
  			if (neg)
  				return -ret;
  			return ret;
  		}
  
  		public double nextDouble() throws IOException
  		{
  			double ret = 0, div = 1;
  			byte c = read();
  			while (c <= ' ')
  				c = read();
  			boolean neg = (c == '-');
  			if (neg)
  				c = read();
  
  			do {
  				ret = ret * 10 + c - '0';
  			} while ((c = read()) >= '0' && c <= '9');
  
  			if (c == '.') {
  				while ((c = read()) >= '0' && c <= '9') {
  					ret += (c - '0') / (div *= 10);
  				}
  			}
  
  			if (neg)
  				return -ret;
  			return ret;
  		}
  
  		private void fillBuffer() throws IOException
  		{
  			bytesRead = din.read(buffer, bufferPointer = 0,
  					BUFFER_SIZE);
  			if (bytesRead == -1)
  				buffer[0] = -1;
  		}
  
  		private byte read() throws IOException
  		{
  			if (bufferPointer == bytesRead)
  				fillBuffer();
  			return buffer[bufferPointer++];
  		}
  
  		public void close() throws IOException
  		{
  			if (din == null)
  				return;
  			din.close();
  		}
  	}
  
  	public static boolean check(int arr[],int sort[]) {
  		for(int i = 0;i < arr.length;i++) {
  			if(arr[i] != sort[i]) {
  				return true;
  			}
  
  		}
  		return false;
  	}
  
  	public static int binarySearch(int[] arr, int ele) {
  		int s = 0;
  		int e = arr.length - 1;
  		
  		while(s <= e) {
  			int mid = (s + e)/2;
  			if(arr[mid] < ele) {
  				s = mid + 1;
  			}else if(arr[mid] > ele) {
  				e = mid - 1;
  			}else {
  				return mid;
  			}
  		}
  		return -1;
  	}
  	
  	private static int nextgreater(long[] arr, long target)
      {
          int start = 0, end = arr.length - 1;
     
          int ans = -1;
          while (start <= end) {
              int mid = (start + end) / 2;
     
              // Move to right side if target is
              // greater.
              if (arr[mid] < target) {
                  start = mid + 1;
              }
     
              // Move left side.
              else {
                  ans = mid;
                  end = mid - 1;
              }
          }
          return ans;
      }
  	
  	private static int lastsmaller(long[] arr, long target)
      {
             
          int start = 0, end = arr.length-1;
            // Minimum size of the array should be 1
          if(end == 0) return -1;
          // If target lies beyond the max element, than the index of strictly smaller
          // value than target should be (end - 1)
          if (target > arr[end]) return end;
     
          int ans = -1;
          while (start <= end) {
              int mid = (start + end) / 2;
     
              // Move to the left side if the target is smaller
              if (arr[mid] > target) {
                  end = mid - 1;
              }
     
              // Move right side
              else {
                  ans = mid;
                  start = mid + 1;
              }
          }
          return ans;
      }
  	
  	static int solve(int n, int base)
  	{
  	    // Sum of digits
  	    int result = 0 ;
  	     
  	    // Calculating the number (n) by
  	    // taking mod with the base and adding
  	    // remainder to the result and
  	    // parallelly reducing the num value .
  	    while (n > 0)
  	    {
  	        int remainder = n % base ;
  	        result = result + remainder ;
  	        n = n / base;
  	    }
  	     
  	    // returning the result
  	    return result ;
  	}
  
  	public static void main(String[] args) throws IOException
  	{	
  
  		try{
  			//Your Solve
  			Reader s = new Reader();
  //			Scanner s = new Scanner(System.in);
  			int t = s.nextInt();
  			for(int p = 0;p < t;p++) {
  				int arr[] = new int[3];
  				arr[0] = s.nextInt();
  				arr[1] = s.nextInt();
  				arr[2] = s.nextInt();
  				int m = s.nextInt();
  				
  				int sum = arr[0]+arr[1]+arr[2];
  //				int min1,min2,min3;
  				int min;
  				Arrays.sort(arr);
  				if(arr[2] >= sum - arr[2]) {
  					min = Math.max(0, arr[2]-1 - (arr[0] + arr[1]));
  				}else {
  					min = 0;
  				}
  				
  //				if(a >= sum-a ) {
  //					min1 = Math.max(0, a-1 - (b+c));
  //				}else {
  //					min1 = Math.max(0,0);
  //				}
  //				if(b >= sum-b ) {
  //					min2 = Math.max(0, b-1 - (a+c));
  //				}else {
  //					min2 = Math.max(0,0);
  //				}
  //				if(c >= sum-c ) {
  //					min3 = Math.max(0, c-1 - (b+a));
  //				}else {
  //					min3 = Math.max(0, 0);
  //				}
  				
  //				int min = Math.min(min1,Math.min(min3, min2));
  				int max = Math.max(arr[0]-1, 0) + Math.max(arr[1]-1,0) + Math.max(arr[2]-1, 0);
  				
  				
  //				System.out.println(min + " " + max);		
  				if(m < min) {
  					System.out.println("NO");
  				}else if(m > max) {
  					System.out.println("NO");
  				}else {
  					System.out.println("YES");
  				}
  			
  				
  			}
  
  		}catch(Exception e){
  			return;
  		}
  	}
  }