#include <bits/stdc++.h>
using namespace std;
long long ls[10000005];
long long h[10000005];
int main() {
  long long n, k, m;
  cin >> n >> k >> m;
  for (int i = 1; i <= n; i++) {
    cin >> ls[i];
  }
  double ans = 0;
  sort(ls + 1, ls + n + 1);
  for (int i = 1; i <= n; i++) {
    h[i] = h[i - 1] + ls[i];
  }
  for (int i = 0; i <= min(n, m); i++) {
    double tmp =
        (double)(h[n] - h[i] + min(k * (n - i), m - i)) / (double)(n - i);
    ans = max(ans, tmp);
  }
  printf("%.20f\n", ans);
  return 0;
}
