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

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> vec(n);
    for (int i = 0; i < n; ++i) {
        cin >> vec.at(i);
    }
    sort(vec.begin(), vec.end());
    int count = 0;
    while (1) {
        if (m > vec.at(0)) {
            m -= vec.at(0);
            vec.erase(vec.begin());
            count++;
        } else if (m == vec.at(0)) {
            count++;
            break;
        } else {
            break;
        }

    }
    cout << count << endl;
    return 0;
}