#include <bits/stdc++.h>
using namespace std;
int M, K, i, st, ed, ans[2], arr[100005];
int main() {
  cin >> M >> K;
  for (i = st = ed = 0; i < M; i++) cin >> arr[i];
  sort(arr, arr + M, greater<int>());
  while (1) {
    while ((ed + 1) < M && (arr[st] - arr[ed + 1]) <= K)
      K -= (arr[st] - arr[++ed]);
    if ((ed - st + 1) >= ans[0]) {
      ans[0] = (ed - st + 1);
      ans[1] = arr[st];
    }
    if (ed == M - 1 || st == M - 1) break;
    K += ((arr[st] - arr[st + 1]) * (ed - st));
    st++;
  }
  cout << ans[0] << " " << ans[1] << endl;
}
