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: //This code is written by प्रविण शंखपाळ 
  
  //package wizard;
  
  import java.io.*;
  import java.math.*;
  import java.util.*;
  
  import java.text.*;
  
  public class Luna_Lovegood {
  
  	static int mod = (int) 1e9 + 7;
  
  	public static void main(String[] args) {
  
  //		try {
  
  		FastReader fr = new FastReader();
  		PrintWriter pt = new PrintWriter(System.out);
  
  		int t = fr.nextInt();
  
  		while (t > 0) {
  
  			long A[] = new long[3];
  			for (int i = 0; i < 3; i++) {
  				A[i] = fr.nextLong();
  			}
  			sort(A, 0, 3 - 1);
  
  			long m = fr.nextLong();
  			pt.println((A[2] - (A[0] + A[1]) - 1 <= m && m <= A[0] + A[1] + A[2] - 3) ? "YES" : "NO");
  
  			t--;
  		}
  
  		pt.close();
  
  //		} catch (
  //
  //		Exception e) {
  //			return;
  //		}
  	}
  
  	static int lower_bound(long[] arr, int begin, int end, long tar) {
  		while (begin < end) {
  			int mid = begin + (end - begin) / 2;
  			if (arr[mid] < tar)
  				begin = mid + 1;
  			else if (arr[mid] >= tar)
  				end = mid;
  		}
  		return begin;
  //		lower bound gives largest index of a number smaller than (if target is not present) or equal to target(if target is present) 
  //      for complete array use begin = 0 and end = n
  	}
  
  	static int upper_bound(long[] arr, int begin, int end, long tar) {
  		while (begin < end) {
  			int mid = begin + (end - begin) / 2;
  			if (arr[mid] <= tar)
  				begin = mid + 1;
  			else if (arr[mid] > tar)
  				end = mid;
  		}
  
  		return begin;
  //		upper bound gives smallest index of a number strictly greater than target
  //	    for complete array use begin = 0 and end = n
  	}
  
  	public static void mergeSort(String[] nameGo) {
  		if (nameGo.length > 1) {
  			String[] leftGo = new String[nameGo.length / 2];
  			String[] rightGo = new String[nameGo.length - nameGo.length / 2];
  			for (int so = 0; so < leftGo.length; so++) {
  				leftGo[so] = nameGo[so];
  			}
  			for (int ki = 0; ki < rightGo.length; ki++) {
  				rightGo[ki] = nameGo[ki + nameGo.length / 2];
  			}
  			mergeSort(leftGo);
  			mergeSort(rightGo);
  			merges(nameGo, leftGo, rightGo);
  		}
  	}
  
  	public static void merges(String[] nameH, String[] leftH, String[] rightH) {
  		int as = 0;
  		int bs = 0;
  		for (int i = 0; i < nameH.length; i++) {
  			if (bs >= rightH.length || (as < leftH.length && leftH[as].compareToIgnoreCase(rightH[bs]) < 0)) {
  				nameH[i] = leftH[as];
  				as++;
  			} else {
  				nameH[i] = rightH[bs];
  				bs++;
  			}
  		}
  	}
  
  	static void merge(long arr[], int l, int m, int r) {
  
  		int n1 = m - l + 1;
  		int n2 = r - m;
  
  		long L[] = new long[n1];
  		long R[] = new long[n2];
  
  		for (int i = 0; i < n1; ++i)
  			L[i] = arr[l + i];
  		for (int j = 0; j < n2; ++j)
  			R[j] = arr[m + 1 + j];
  
  		int i = 0, j = 0;
  
  		int k = l;
  		while (i < n1 && j < n2) {
  			if (L[i] <= R[j]) {
  				arr[k] = L[i];
  				i++;
  			} else {
  				arr[k] = R[j];
  				j++;
  			}
  			k++;
  		}
  
  		while (i < n1) {
  			arr[k] = L[i];
  			i++;
  			k++;
  		}
  
  		while (j < n2) {
  			arr[k] = R[j];
  			j++;
  			k++;
  		}
  	}
  
  	static void sort(long arr[], int l, int r) {
  		if (l < r) {
  
  			int m = l + (r - l) / 2;
  
  			sort(arr, l, m);
  			sort(arr, m + 1, r);
  
  			merge(arr, l, m, r);
  		}
  	}
  
  	static class Pair implements Comparable<Pair> {
  		int a, b;
  
  		Pair(int a, int b) {
  			this.a = a;
  			this.b = b;
  		}
  
  		public int compareTo(Pair o) {
  			// TODO Auto-generated method stub
  			if (this.a != o.a)
  				return Integer.compare(this.a, o.a);
  			else
  				return Integer.compare(this.b, o.b);
  			// return 0;
  		}
  
  		public boolean equals(Object o) {
  			if (o instanceof Pair) {
  				Pair p = (Pair) o;
  				return p.a == a && p.b == b;
  			}
  			return false;
  		}
  
  	}
  
  	static int binarySearch(int arr[], int first, int last, int key) {
  		int mid = (first + last) / 2;
  		while (first <= last) {
  			if (arr[mid] < key) {
  				first = mid + 1;
  			} else if (arr[mid] == key) {
  				return mid;
  			} else {
  				last = mid - 1;
  			}
  			mid = (first + last) / 2;
  		}
  		return -1;
  	}
  
  	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;
  		}
  	}
  }
  