#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <random>
#include <stdio.h>
#include <fstream>
#include <functional>
#include <cassert>
#include <unordered_map>
#include <bitset>
#include <atcoder/all>

using namespace std;
using namespace atcoder;



#define rep(i,n) for (int i=0;i<n;i+=1)
#define rrep(i,n) for (int i=n-1;i>-1;i--)
#define pb push_back
#define all(x) (x).begin(), (x).end()

template<class T>
using vec = vector<T>;
template<class T>
using vvec = vec<vec<T>>;
template<class T>
using vvvec = vec<vvec<T>>;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;




template<class T>
bool chmin(T &a, T b){
  if (a>b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmax(T &a, T b){
  if (a<b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
T sum(vec<T> x){
  T res=0;
  for (auto e:x){
    res += e;
  }
  return res;
}

template<class T>
void printv(vec<T> x){
  for (auto e:x){
    cout<<e<<" ";
  }
  cout<<endl;
}

template<class T>
ostream& operator<<(ostream& os, const vec<T>& A){
  os << "{";
  rep(i,A.size()){
    os << A[i];
    if (i!=A.size()-1){
      os << ' ';
    }
  }
  os<<"}";
  return os;
}

template<class T,class U>
ostream& operator<<(ostream& os, const pair<T,U>& A){
  os << "(" << A.first <<", " << A.second << ")";
  return os;
}

template<class T>
ostream& operator<<(ostream& os, const deque<T>& A){
  os << "deque({";
  rep(i,A.size()){
    os << A[i];
    if (i!=A.size()-1){
      os << ' ';
    }
  }
  os<<"})";
  return os;
}

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int T;
  cin>>T;
  while (T--){
    int N,M;
    cin>>N>>M;
    vec<int> A(N+1);
    rep(i,N){cin>>A[i+1];}
    vec<int> B(N+1);
    B[0] = M;
    string ans = "Yes";
    rep(i,N){
      if (B[i] < A[i+1]-B[i+1]){
        //cout << A << B << endl;
        ans = "No";
        break;
      }
      int p = A[i+1] - B[i+1];
      B[i+1] += p;

      if (i!=N-1){
        B[i+2] += B[i] - p;
        if (B[i+2] > A[i+2]){
          //cout << A << B << endl;
          ans = "No";
          break;
        }
      }
      else{
        if (B[i]-p!=0){
          //cout << A << B << endl;
          ans = "No";
          break;
        }
      }
      B[i] = 0;
    }
    cout << ans << endl;
  }

  
  

  
}