#include <bits/stdc++.h>
using namespace std;
const int N = 107;
long long a[N], n, m, k;
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    scanf("%lld%lld%lld", &n, &m, &k);
    for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
    int i;
    for (i = 1; i < n; i++) {
      if (a[i] + k >= a[i + 1]) {
        int d = a[i] + k - a[i + 1];
        if (d > a[i]) {
          m += a[i];
        } else {
          m += d;
        }
      } else if (a[i + 1] > a[i] + k) {
        long long c = a[i + 1] - a[i] - k;
        if (c > m) {
          break;
        } else {
          m = m - c;
        }
      }
    }
    if (i == n)
      cout << "Yes" << endl;
    else
      cout << "No" << endl;
  }
}
