#include #define rep(i,n) for(int i = 0; i < n; i++) //[0,n) #define srep(i,a,b) for(int i = a; i < b; i++) //[a,b) #define all(A) (A).begin(),(A).end() #define rall(A) (A).rbegin(),(A).rend() #define pmt(A) next_permutation(all(A)) using namespace std; using ll = long long; using ull = unsigned long long; using P = pair; using pq = priority_queue,greater

>; ll inf = 8e18; int iinf = (int)1e9; int mod9 = 998244353; int mod1 = 1000000007; struct Edge { int to; int cost; int from; }; bool compe(const Edge &e,const Edge &e2){ return e.cost < e2.cost; } using Graph = vector>; using SGraph = vector>; template int siz(T& a){return (int)a.size();} int main(void){ int n; cin >> n; ll k; cin >> k; vector B(n-1); rep(i,n-1) cin >> B[i]; ll ok = 0,ng = (ll)1e18+1; bool judge = 0; while(abs(ok-ng) > 1){ ll mid = (ok+ng) >> 1; vector A(n+1,0); A[0] = mid; ll sum = 0; rep(i,n) A[i+1] = B[i]+A[i]; rep(i,n) sum += A[i]; if(sum <= k){ if(sum == k) judge = 1; ok = mid; } else ng = mid; } cout << (judge ? "Yes" : "No"); }