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;
long long n, m, k;
long long int temp1, t, mini = 1000000007, a[100008];
long long fastpow(long long int a, long long int b) {
  if (b == 0) return 1ll;
  long long ret = fastpow(a, b / 2);
  ret = (ret * ret) % 1000000007;
  ret = (ret + 1000000007) % 1000000007;
  if (b % 2 == 1) ret = (ret * a) % 1000000007;
  ret = (ret + 1000000007) % 1000000007;
  return ret;
}
vector<long long int> vec[100008];
long long int visited[100008];
void dfs(long long int node) {
  visited[node] = 1;
  mini = min(a[node], mini);
  for (int i = 0; i < vec[node].size(); i++) {
    if (!visited[vec[node][i]]) {
      dfs(vec[node][i]);
    }
  }
}
map<long long int, long long int> mymap;
long long int pre[100008], d;
long long int findmax(long long int lo, long long int hi,
                      long long int offset) {
  long long int low = lo, high = hi;
  while (low < high) {
    long long int mid = (high + low) / 2;
    long long int check = d - mid + offset;
    auto it = mymap.upper_bound(check);
    if (it != mymap.end()) {
      high = mid - 1;
    } else {
      low = mid + 1;
    }
  }
  long long int temp = d - low + offset;
  auto tt = mymap.upper_bound(temp);
  if (tt != mymap.end()) {
    if (low == 0) return -1;
    return low - 1;
  } else {
    return low;
  }
}
int main() {
  bool flag = 0;
  long long int ans = 0;
  cin >> n >> d;
  for (int i = 1; i <= n; i++) cin >> a[i];
  pre[0] = 0;
  for (int i = 1; i <= n; i++) {
    pre[i] = pre[i - 1] + a[i];
    auto it = mymap.find(pre[i]);
    if (it != mymap.end()) {
      mymap[pre[i]]++;
    } else {
      mymap[pre[i]] = 1;
    }
  }
  long long int cur = 0;
  for (int i = 1; i <= n; i++) {
    auto it = mymap.find(pre[i]);
    if ((it->second) == 1) {
      mymap.erase(it);
    } else {
      (it->second)--;
    }
    if (a[i]) {
      cur += a[i];
    } else {
      if (cur < 0) {
        long long int res = findmax(0, d, pre[i]);
        if (res != -1) {
          cur = res;
          ans++;
        } else {
          flag = 1;
          break;
        }
      }
    }
    if (cur > d) {
      flag = 1;
      break;
    }
  }
  if (!flag)
    cout << ans << endl;
  else
    cout << -1 << endl;
  return 0;
}
