#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;


int main(int argc, char const *argv[]) {
  ll n, m;std::cin >> n >> m;
  vll a(n);re(i, n) std::cin >> a[i];
  ll s = 0;
  sort(all(a));
  ll cnt = 0;
  for(int i=0;i<n;i++, cnt++){
    if(s + a[i] > m){
      std::cout << cnt << '\n';
      return 0;
    }
    s += a[i];
  }
  std::cout << cnt << '\n';
  return 0;
}