#include <iostream>
#include <vector>
#include <algorithm>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)

using namespace std;

typedef long long int lli;

int main() {
    int N, M;
    cin >> N >> M;
    vector<int> C(N);
    REP (i, 0, N) cin >> C[i];
    sort(C.begin(), C.end());
    int cnt = 0;
    while (M > 0) {
        M -= C[cnt++];
    }
    cout << cnt - !!M << endl;
    return 0;
}