#include<iostream>
#include<queue>
#include<cstdio>
#include<utility>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
	int sum=0,counter=0,n,m;scanf("%d%d",&n,&m);
	int *are=new int[n];
	for(int i=0;i<n;i++)scanf("%d",&are[i]);
	sort(are,are+n);
	for(int i=0;i<n;i++){
		sum+=are[i];
		if(sum>m){
			break;
		}else if(sum==m){
			counter++;
			break;
		}counter++;
	}cout<<counter<<endl;
}