#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

void solve() {
  int n, m; cin >> n >> m;
  vector<int> a(n + 1, m); FOR(i, 1, n + 1) cin >> a[i];
  if (n == 1) {
    cout << "Yes\n";
    return;
  }
  vector<ll> b(n + 2, 0);
  b[0] = m;
  REP(i, n) {
    if (b[i] != a[i]) {
      cout << "No\n";
      return;
    }
    const int x = a[i + 1] - b[i + 1];
    if (x < 0 || b[i] < x) {
      cout << "No\n";
      return;
    }
    b[i] -= x;
    b[i + 1] += x;
    b[i + 2] += b[i];
    b[i] = 0;
  }
  cout << (b[n] == a[n] ? "Yes\n" : "No\n");
}

int main() {
  int t; cin >> t;
  while (t--) solve();
  return 0;
}