#include <bits/stdc++.h>
using namespace std;
int super[(int)1e5 + 10];
int main() {
  int n, k, m;
  scanf("%d%d%d", &n, &k, &m);
  long long all = 0;
  long double ans = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &super[i]);
    all += (long long)super[i];
  }
  sort(super, super + n);
  for (int pr = 0; pr < n; pr++) {
    if (pr > m) break;
    long long temp = (long long)(m - pr);
    if (temp > (long long)(n - pr) * k) temp = (long long)(n - pr) * k;
    if (ans < (long double)(all + temp) / (n - pr))
      ans = (long double)(all + temp) / (n - pr);
    all -= (long long)super[pr];
  }
  cout.precision(20);
  cout << ans;
  return 0;
}
