#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
#include <utility>
#define rep(i,l,n) for(lint i=l;i<n;i++)
#define rer(i,l,n) for(lint i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef vector<lint> vli;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int main(){
	int n,m;
	cin>>n>>m;
	vi c(n);
	rep(i,0,n) cin>>c[i];
	sort(all(c));
	int ans=0;
	rep(i,1,n){
		if(c[i-1]<=m) ans=i;
		c[i]+=c[i-1];
	}
	if(c[n-1]<=m) ans=n;
	o(ans);
}