#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <sstream>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <limits>
#include <complex>
#include <functional>
using namespace std;
#define REP(i,a,b) for (int (i)=(a);(i)<(b);++(i))
#define rep(i,n) REP((i),0,(n))

int main() {
    vector<int> v(10);
    int n, m, ans = 0; cin >> n >> m;
    rep(i, n) {
        cin >> v[i];
    }
    sort(v.begin(), v.begin()+n);
    int cdy = 0;
    rep(i, 10) {
        int t = min(m-cdy, v[i]);
        bool f = false;
        if (m-cdy == v[i]) f = true;
        cdy += t;
        if (cdy != m) ans++;
        else {
            if (f) ans++;
            break;
        }
    }
    cout << ans << endl;
}