#include <bits/stdc++.h>
using namespace std;
int n, m, k;
const int maxn = 1e5 + 100;
int a[maxn];
long long sum[maxn];
int main() {
  scanf("%d%d%d", &n, &k, &m);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
  double res = 0;
  for (int i = 0; i <= min(n - 1, m); i++) {
    double ans = sum[n] - sum[i];
    int mm = m - i;
    ans += min(1LL * k * (n - i), (long long)mm);
    ans /= (n - i);
    res = max(res, ans);
  }
  printf("%.15f\n", res);
  return 0;
}
