#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
    
    int N,M;
    cin >> N >> M;
    vector<int> A(N);
    for ( int i = 0; i < N; i++ ) {
        cin >> A[i];
    }
    sort( A.begin(), A.end() );
    
    long long s = 0;
    int ans = N;
    for ( int i = 0; i < N; i++ ) {
        s += A[i];
        if ( s > M ) {
            ans = i;
            break;
        }
        else if ( s == M ) {
            ans = i+1;
            break;
        }
    }
    
    cout << ans << endl;
    
    return 0;
}