#include <iostream>
#include <iomanip>

#include <algorithm>
#include <math.h>

#include <string>
#include <list>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

int main(void){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed;//
    //cout << setprecision(6);//

    int N,M;
	cin>>N>>M;//N[1,10] M[1,10^6]
	int C[10];
	rep(i,N){
		cin>>C[i];
	}
	sort(C,C+N);
	int sum=0;
	int count = 0;
	rep(i,N){
		sum += C[i];
		if(sum<M){
			++count;
		}else if(sum==M){
			++count;
			break;
		}else{
			break;
		}
	}
	cout << count << endl;
    return 0;
}