#include <iostream>
#include <algorithm>
using namespace std;
 
int main(){
	int N, M;
	cin >> N >> M;
	int C[N];
	for(int i = 0; i < N; i++){
		cin >> C[i];
	}
	sort(C, C + N);
	int get = 0;
	for(int i = 0; i < N; i++){
		get += C[i];
		if(get == M){
			cout << i + 1 << endl;
			return 0;
		}else if(get > M){
			cout << i << endl;
			return 0;
		}
	}
}