#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double pi = 3.1415926535897932384626;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
const int maxn = 1e5 + 5;
long long n, k, m, a[maxn], sum[maxn];
int main() {
  n = read(), k = read(), m = read();
  for (int i = 1; i <= n; ++i) a[i] = read();
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; ++i) sum[i] = sum[i - 1] + a[i];
  double ans = 0;
  for (int i = 0; i < n && i <= m; ++i) {
    long long x = min(m - i, (n - i) * k);
    ans = max(ans, (sum[n] - sum[i] + x) / 1.0 / (n - i));
  }
  printf("%.15f\n", ans);
  return 0;
}
