#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int n, k, m, a[maxn];
long long s;
double ans;
int main() {
  scanf("%d%d%d", &n, &k, &m);
  for (int i = 1; i <= n; ++i) scanf("%d", a + i);
  sort(a + 1, a + 1 + n, greater<int>());
  for (int i = 1; i <= n; ++i) {
    s += a[i];
    long long need = n - i;
    if (need > m) continue;
    ans = max(ans, 1.0 * (s + 1ll * min(m - need, 1ll * i * k)) / i);
  }
  printf("%.7f\n", ans);
  return 0;
}
