#include <bits/stdc++.h>
using namespace std;
int n;
long long m, k;
long long a[110];
int main() {
  int q;
  scanf("%d", &q);
  while (q--) {
    scanf("%lld%lld%lld", &n, &m, &k);
    for (int i = 1; i <= n; i++) {
      scanf("%lld", &a[i]);
    }
    if (1 == n) {
      printf("YES\n");
      continue;
    }
    int kk = 0;
    for (int i = 1; i < n; i++) {
      long long x = max(1ll * 0, a[i + 1] - k);
      if (a[i] + m < x) {
        kk = 1;
        break;
      }
      m = m + a[i] - x;
      if (m < 0) {
        kk = 1;
        break;
      }
    }
    if (kk)
      printf("NO\n");
    else
      printf("YES\n");
  }
  return 0;
}
