#include <bits/stdc++.h>
using namespace std;
long long n;
long long k, m;
int main() {
  cin >> n >> k >> m;
  vector<long long> v(n);
  for (int i = 0, to = n; i < to; i++) cin >> v[i];
  sort(v.begin(), v.end());
  long long actual = accumulate(v.begin(), v.end(), 0LL);
  double ans = 0.0;
  for (int i = 0, to = min(n, m + 1); i < to; i++) {
    long long aumentar = min(m - i, (long long)(n - i) * k);
    ans = max(ans, (double)(actual + aumentar) / (double)(n - i));
    actual -= v[i];
  }
  printf("%.10f\n", ans);
  return 0;
}
