#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
using namespace std;
const int INF = 1e9;

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    rep(i, n) cin >> a[i];
    sort(a.begin(), a.end());

    int cnt = 0;
    rep(i, n) {
        m -= a[i];
        ++cnt;
        if (m <= 0)
            break;
    }

    cout << cnt - (m != 0) << endl;

    return 0;
}