#include <bits/stdc++.h>
using namespace std;
// https://space.bilibili.com/672346917

#ifndef LOCAL
#define LOG(...) 42
#endif

#define fi first
#define se second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

typedef long long LL;
typedef pair <int, int> PII;

constexpr int inf = 0x3f3f3f3f;
constexpr double EPS = 1e-8;
const double PI = acos(-1);

int multi_cases = 1;

void A_SOUL_AvA () {
    int n, k;
    LL m;
    cin >> n >> m >> k;

    vector <LL> a(n + 1);
    vector <LL> pre(n + 1);
    pre[0] = m;

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        pre[i] = pre[i - 1] + a[i];
    }

    int ok = 0;
    function <int(int, int)> dfs = [&](int sta, int res) -> int {
        if (sta <= n && !res) return 1;

        LL damage = pre[sta], mn = 0;

        for (int i = sta + 1; i <= n && i - sta <= k; i++) {
            mn = max(mn - a[i], a[i]);
            if (damage >= mn) {
                return dfs(i, n - i);
            }
        }
        return 0;
    };

    cout << (dfs(0, n) ? "YES" : "NO") << endl;
}

int main () {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout << fixed << setprecision(12);

    int T = 1;
    for (multi_cases && cin >> T; T; T--) {
        A_SOUL_AvA ();
    }

    return 0;
}