#include <bits/stdc++.h>
using namespace std;
int a[100001];
int main() {
  int n, k, m;
  scanf("%d%d%d", &n, &k, &m);
  double sum = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    sum += a[i];
  }
  double ans = 0;
  int p = 0;
  sort(a + 1, a + 1 + n);
  ans = sum + min(n * k, m);
  ans = ans * 1.0 / n;
  if (n == 1) {
    ans = a[1] + min(n * k, m);
    printf("%.20lf\n", ans);
    return 0;
  }
  for (int i = 1; i <= min(n - 1, m); i++) {
    double res = 0;
    sum -= a[i];
    res = sum + min((long long)(n - i) * k, (long long)m - i);
    res = res * 1.0 / (n - i);
    ans = max(ans, res);
  }
  printf("%.20lf\n", ans);
  return 0;
}
