#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const long long INF = 1LL << 60;
const long long mod = 1e9 + 7;
const long double eps = 1e-8;
const long double pi = acos(-1.0);
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
void solve() {
  long long n, x;
  cin >> n >> x;
  vector<long long> a(n);
  vector<long long> sum(n + 1, 0);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    sum[i + 1] = sum[i] + a[i];
  }
  sort(a.begin(), a.end());
  if (sum[n] == x) {
    cout << n << endl;
  } else if (sum[n] < x) {
    cout << n - 1 << endl;
  } else {
    long long ans = 0;
    for (long long i = 0; i < n + 1; i++)
      if (sum[i] <= x) chmax(ans, i);
    cout << ans << endl;
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
