#include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <sys/time.h>
#include <cctype>

using namespace std;

typedef long long ll;


int main() {
  int n, m;
  cin >> n >> m;
  int c[n];
  for (int i = 0; i < n; i++) {
    cin >> c[i];
  }
  sort(c, c+n);
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    if(m-c[i] == 0) {
      cnt++;
      break;
    }else if (m-c[i] < 0){
      break;
    }
    m -= c[i];
    cnt++;
  }
  std::cout << cnt << std::endl;
}