#include #define int long long #define rep(i, n) for(i = 0; i < n; i++) using namespace std; int n, m; int a[200001]; int b[200002]; bool solve() { int i; rep(i, n + 1) b[i] = 0; b[0] = m; rep(i, n) { int x = a[i + 1] - b[i + 1]; if (x < 0 || x > b[i]) { return false; } b[i + 1] += x; b[i + 2] += b[i] - x; } for (i = 1; i <= n; i++) if (b[i] != a[i]) { return false; } return true; } signed main() { int t; cin >> t; while (t--) { cin >> n >> m; for (int i = 0; i < n; i++) cin >> a[i + 1]; bool res = solve(); if (res) cout << "Yes" << endl; else cout << "No" << endl; } return 0; }