#include <bits/stdc++.h>
using namespace std;
int n, k, m;
int nt, kt, mt;
int su[100004];
long long sum = 0;
double res;
int main() {
  scanf("%d%d%d", &n, &k, &m);
  nt = n;
  kt = k;
  mt = m;
  for (int i = 0; i < n; i++) {
    scanf("%d", su + i);
    sum += su[i];
  }
  res = 1.0 * sum / n;
  sort(su, su + n);
  long long ts = 0;
  for (int i = 1; i <= n; i++) {
    ts += su[n - i];
    long long rm = m - n + i;
    long long te = i;
    long long tk = k;
    if (rm < 0) {
      continue;
    }
    res = max(res, (ts + min(rm, te * tk)) * 1.0 / te);
  }
  printf("%lf\n", res);
  return 0;
}
