#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
    ll n,m;
    cin >> n >> m;
    vector<ll> a(n);
    for(int i = 0;i < n;i++)cin >> a[i];
    ll res = 0;
    sort(a.begin(),a.end());
    for(int i = 0;i < n;i++){
        if(m <= 0)break;
        res++;
        m -= a[i];
    }
    if(m < 0)res--;
    cout << res << endl;
}