#include <bits/stdc++.h>
using namespace std;
const int kMaxN = 105;
int n, x, a[kMaxN];
map<int, int> mp;
int main() {
  scanf("%d%d", &n, &x);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a + i);
  }
  sort(a + 1, a + n + 1);
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    if ((x -= a[i]) >= 0) ++ans;
  }
  if (x > 0) --ans;
  printf("%d\n", ans);
  return 0;
}
