#pragma region Macros

#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
// using namespace __gnu_cxx;

#define TO_STRING(var) # var
#define pb emplace_back
#define int ll
#define endl '\n'

using ll = long long;
using ld = long double;
const ld PI = acos(-1);
const ld EPS = 1e-10;
const int INF = 1 << 30;
const ll INFL = 1LL << 62;
const int MOD = 998244353;
// const int MOD = 1000000007;

int ceil(int x, int y) {return (x > 0 ? (x + y - 1) / y : x / y);}
int POW(int x, int y) {
    if (y != (int)(y) or y < 0 or x != 0 && x != 1 && y > 64) {cout << "Error" << endl;return 0;}
    if (y == 0) return 1;
    if (y % 2 == 0) return POW(x * x, y / 2);
    return x * POW(x, y - 1);
}

__attribute__((constructor))
void constructor() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
}

#pragma endregion

signed main() {
    int T;
	cin >> T;

	for (int t = 0; t < T; t++) {
		int N, M;
		cin >> N >> M;

		vector<int> A(N);
		for (int i = 0; i < N; i++) cin >> A[i];

		if (N == 1) {cout << "Yes" << endl; continue;}

		bool flag = true;
		vector<int> dp(N + 23);
		dp[0] = M;
		dp[0] -= A[0];
		dp[1] = A[0];
		dp[2] += dp[0];
		if (dp[2] > A[1]) flag = false;
		dp[0] = 0;
		
		for (int i = 1; i < N; i++) {
			if (dp[i] > A[i - 1]) flag = false;
			dp[i] -= (A[i] - dp[i + 1]);
			if (dp[i] < 0) flag = false;
			dp[i + 1] = A[i];
			dp[i + 2] += dp[i];
			if (dp[i + 2] > A[i - 1]) flag = false;
			dp[i] = 0;
		}
		if (dp[N] > A[N - 1]) flag = false;
		cout << (flag ? "Yes" : "No") << endl;

	}
}