#include <algorithm>
#include <iostream>
#include <iomanip>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cmath>
using namespace std;

#define FOR(i,s,e) for (int i = int(s); i < int(e); i++)
#define FORIT(i,c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define ISEQ(c) (c).begin(), (c).end()

int main(){
	int N,M;
	cin >> N >> M;
	int C[N];
	FOR(i,0,N) cin >> C[i];

	sort(C,C+N);

	int now = 0;
	int ans = 0;

	FOR(i,0,N){
		if (C[i] + now > M) break;
		now += C[i];
		ans ++ ;
	}

	cout << ans << endl;
	return 0;
}