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