#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10, INF = 0x3f3f3f3f, MOD = 1E9 + 7;
int n, m, a[N], ans;
int main(int argc, char* argv[]) {
    cin >> n >> m;
    for (int i = 0; i < n; i++)
        cin >> a[i];
    sort(a, a + n);

    for (int i = 0; i < n; i++)
        if (m >= a[i]) {
            m -= a[i];
            ans++;
        }
    cout << ans << endl;
    return 0;
}