9 13
6 14 19 5 -5 6 -10 20 8
 8 9
6 -1 5 -5 -8 -7 -8 -7
 10 7
-9 3 -4 -22 4 -17 0 -14 3 -2
 6 2
-2 3 0 -2 0 0
 5 10
-8 -24 0 -22 12
 5 13756
-2 -9 -10 0 10
 7 3
1 -3 0 3 -1 0 2
 9 9
-3 2 0 -2 -7 -1 0 5 3
 2 3
2 0
 19 78701
1 0 -1 0 -1 -1 0 1 0 -1 1 1 -1 1 0 0 -1 0 0
 5 4
-1 0 0 1 -1
 6 4
-1 0 2 -4 0 5
 20 23036
-1 1 -1 -1 -1 -1 1 -1 -1 0 0 1 1 0 0 1 0 0 -1 -1
 5 4
-1 0 -3 0 3
 12 82016
1 -2 -1 -1 -2 -1 0 -2 -1 1 -2 2
 7 4
-6 0 2 -3 0 4 0
 4 4
2 2 0 1
 6 1
-3 0 0 0 -2 3
 8 26
-4 9 -14 -11 0 7 23 -15
 20 23079
0 1 1 -1 1 0 -1 -1 0 0 1 -1 1 1 1 0 0 1 0 1
 1 1
1
 7 8555
-2 -3 -2 3 0 -2 0
 4 100
-100 0 -50 100
 3 14
12 12 -8
 1 1
2
 10 23
9 7 14 16 -13 -22 24 -3 -12 14
 8 11
12 -12 -9 3 -22 -21 1 3
 19 49926
-2 0 2 0 0 -2 2 -1 -1 0 0 0 1 0 1 1 -2 2 2
 16 76798
-1 11 -7 -4 0 -11 -12 3 0 -7 6 -4 8 6 5 -10
 9 5
-2 0 3 -4 0 4 -3 -2 0

-1
 -1
 1
 1
 1
 1
 -1
 2
 0
 1
 1
 -1
 1
 1
 1
 1
 -1
 1
 -1
 0
 0
 1
 1
 -1
 -1
 -1
 -1
 1
 1
 1

#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rnd64(
    chrono::high_resolution_clock::now().time_since_epoch().count());
template <typename T = int>
inline T read() {
  T res = 0, sig = 1;
  char c = getchar();
  while ((c < '0' || c > '9') && c != '-') {
    c = getchar();
  }
  if (c == '-') {
    sig = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    res = res * 10 + c - '0';
    c = getchar();
  }
  return res * sig;
}
void setio(const char *in, const char *out) {
  freopen(in, "r", stdin);
  freopen(out, "w", stdout);
}
void setio(const string task) {
  freopen((task + ".in").c_str(), "r", stdin);
  freopen((task + ".out").c_str(), "w", stdout);
}
void fastio() {
  ios::sync_with_stdio(false);
  cin.tie(0);
}
int main() {
  fastio();
  int n;
  long long d;
  cin >> n >> d;
  vector<long long> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<long long> pr(n);
  pr[0] = a[0];
  for (int i = 1; i < n; i++) {
    pr[i] = pr[i - 1] + a[i];
  }
  for (int i = 0; i < n; i++) {
    if (pr[i] > d) {
      cout << "-1\n";
      return 0;
    }
  }
  vector<long long> su(n);
  su[n - 1] = pr[n - 1];
  for (int i = n - 2; i > -1; i--) {
    su[i] = max(su[i + 1], pr[i]);
  }
  int ans = 0;
  long long cur = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] == 0 && pr[i] + cur < 0) {
      ans++;
      long long mx = d - (su[i] + cur);
      if (mx < -(pr[i] + cur)) {
        cout << "-1\n";
        return 0;
      }
      cur += mx;
    }
  }
  cout << ans;
  return 0;
}
