#include <bits/stdc++.h>
using namespace std;
long long n, k, m;
long long sum;
long long a[100005];
double ans;
int main() {
  scanf("%lld%lld%lld", &n, &k, &m);
  for (long long i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
    sum += a[i];
  }
  sort(a, a + n + 1);
  long long i;
  for (i = 0; i <= m && i < n; i++) {
    long long cnt = 0;
    if (m - i > (n - i) * k)
      cnt = (n - i) * k;
    else
      cnt = m - i;
    sum -= a[i];
    ans = max(ans, 1.0 * (sum + cnt) / (n - i));
  }
  printf("%.7lf\n", ans);
  return 0;
}
