#include <iostream>
#include <algorithm>
using namespace std;

const int MAX_N = 20000;
int H[MAX_N];
int main() {
    int N, B;
    cin >> N >> B;
    for (int i = 0; i < N; ++i) {
        cin >> H[i];
    }
    sort(H, H + N);
    long long sum = 0;
    int count = 0;
    for (int i = 0; i < N; ++i) {
        sum += H[i];
        if (sum >= B) {
            count = i + 1;
            break;
        }
    }

    cout << count;
    return 0;
}