#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
#include <cassert>
#include <complex>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
const int inf = 1e8;



int main() {
    int n,m;
    cin>>n>>m;
    vector<int>c(n);
    for(int i=0;i<n;i++)cin>>c[i];
    sort(c.begin(),c.end());
    int now = 0;
    int ans = 0;
    for(int i=0;i<n;i++){
        if(now+c[i]<m){
            now+=c[i];
            ans++;
        }
        else{
            if(now+c[i]==m){
                ans++;
                break;
            }
            else{
                break;
            }
        }
    }
    cout<<ans<<endl;
}