#include<bits/stdc++.h>
using namespace std;
#define i64 long long
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
int N; i64 P, a[100005];
bool check(int l) {
  priority_queue<int> pq;
  pq.push(P);
  for (int i = 1; i <= l; i ++) {
    i64 cur = pq.top(); pq.pop();
    if (cur < a[i]) return true;
    i64 left = min(cur - a[i], a[l] - 1);
    if (left) pq.push(left);
    i64 right = cur - a[i] - left;
    if (right) pq.push(right);
  }
  return false;
}
void Solve(void) {
  cin >> N >> P;
  for (int i = 1; i <= N; i ++) cin >> a[i];
  int l = 1, h = N;
  while (l <= h) {
    int mid = (l + h)/2;
    // nearest can't go
    if (check(mid)) h = mid - 1;
    else l = mid + 1;
  }
  // cout << check(4) << "\n";
  cout << l - 1 << "\n";
}
signed main() {
  ios_base::sync_with_stdio(false); cin.tie(0);
  int Tests = 1; // cin >> Tests;
  while (Tests --) {
    Solve();
  }
}