#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000000007
#define INF 1000000000 //(int)1e9
#define LLINF 2000000000000000000 //(ll)2e18
#define PI  3.1415926536

#define SIZE 1000

int main(){
    int n,m,c[SIZE]={0};
    scanf("%d%d",&n,&m);
    
    for(int i=0;i<n;i++) scanf("%d",&c[i]);
    
    sort(c,c+n);
    
    for(int i=0;i<n;i++){
        if(c[i]>m){
            printf("%d\n",i);
            return 0;
        }
        
        c[i+1]+=c[i];
    }
    
    printf("%d\n",n);
    
    return 0;
}