#include <iostream>
#include <cassert>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int N, K; cin >> N >> K;
  vector<int> A(N);
  for (int &i: A) cin >> i;
  sort(A.begin(), A.end());
  for (int i = 0; i < N; i++) {
    if (K - A[i] < 0) {
      cout << i << ' ' << K << endl;
      return 0;
    }
    K -= A[i];
  }
  cout << N << ' ' << K << endl;
  return 0;
}