#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int n, m;
    cin >> n >> m;
    int A[n];
    for( int i = 0; i < n; ++i )
    {
        cin >> A[i];
    }
    sort(A, A+n);
    int taken = 0;
    for( int i = 0; i < n; ++i )
    {
        if( A[i] <= m )
        {
            m -= A[i];
            ++taken;
        }
        else
        {
            break;
        }
    }

    cout << taken << endl;

    return 0;
}