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;
const int MAXN = 100010;
const int INF = 0x3fffffff;
int a[MAXN], sum[MAXN], tr[MAXN << 2], tag[MAXN << 2];
void PushDown(int rt, int l, int r) {
  if (l < r) {
    tr[rt << 1] += tag[rt], tag[rt << 1] += tag[rt];
    tr[rt << 1 | 1] += tag[rt], tag[rt << 1 | 1] += tag[rt];
  }
  tag[rt] = 0;
}
void PushUp(int rt) { tr[rt] = max(tr[rt << 1], tr[rt << 1 | 1]); }
void BuildTree(int rt, int l, int r) {
  if (l == r) {
    tr[rt] = sum[l];
    return;
  }
  int mid = (l + r) / 2;
  BuildTree(rt << 1, l, mid), BuildTree(rt << 1 | 1, mid + 1, r);
  PushUp(rt);
}
int Query(int rt, int l, int r, int s, int t) {
  if (tag[rt]) PushDown(rt, l, r);
  if (s <= l && t >= r) return tr[rt];
  int mid = (l + r) / 2, ans = -INF;
  if (s <= mid) ans = Query(rt << 1, l, mid, s, t);
  if (t > mid) ans = max(ans, Query(rt << 1 | 1, mid + 1, r, s, t));
  PushUp(rt);
  return ans;
}
void Modify(int rt, int l, int r, int s, int t, int x) {
  if (tag[rt]) PushDown(rt, l, r);
  if (s <= l && t >= r) {
    tr[rt] += x;
    tag[rt] = x;
    return;
  }
  int mid = (l + r) / 2;
  if (s <= mid) Modify(rt << 1, l, mid, s, t, x);
  if (t > mid) Modify(rt << 1 | 1, mid + 1, r, s, t, x);
  PushUp(rt);
}
int main() {
  int n, d;
  scanf("%d%d", &n, &d);
  int mx = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    sum[i] = sum[i - 1] + a[i];
    mx = max(mx, sum[i]);
  }
  if (mx > d) {
    printf("-1\n");
    return 0;
  }
  BuildTree(1, 1, n);
  int now = 0, cnt = 0;
  for (int i = 1; i <= n; i++) {
    if (a[i] == 0) {
      if (now >= 0) continue;
      int q = Query(1, 1, n, i, n);
      now += d - q, cnt++;
      if (now < 0) {
        printf("-1");
        return 0;
      }
      if (i < n) Modify(1, 1, n, i + 1, n, d - q);
    } else {
      now += a[i];
    }
  }
  printf("%d\n", cnt);
}
