#include <iostream> #include <algorithm> using namespace std; int main() { int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } sort(a, a + n); int cnt = 0; for (int i = 0; i < n; i++) { if (a[i] <= k) { cnt += 1; k -= a[i]; } else { break; } } cout << cnt << endl; return 0; }