#include <iostream>
#include <sstream>
#include <math.h>
#include <stack>
#include <set>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <map>
#include <cstdio>
#include <vector>
using namespace std;

#define INF (1 << 30)
#define INFLL (1LL << 60)

int main() {
	int n,m,c[11];
	cin >> n >> m;
	for(int i = 0;i < n;i++){
		cin >> c[i];
	}
	sort(c,c + n);
	int ans = 0;
	for(int i = 0;i < n;i++){
		if(m - c[i] >= 0){
			m -= c[i];
			ans++;
		}
	}
	cout << ans << endl;
	return 0;
}