#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n, k, m;
int a[maxn];
int main() {
  cin >> n >> k >> m;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  sort(a + 1, a + n + 1);
  long long sum = accumulate(a + 1, a + n + 1, 1ll * 0);
  double ans = 1.0 * sum / n;
  long long t;
  for (int i = 0; i < n && i <= m; ++i) {
    sum -= a[i];
    t = sum + min(1ll * (m - i), 1ll * (n - i) * k);
    ans = max(ans, 1.0 * t / (n - i));
  }
  printf("%.7f\n", ans);
  return 0;
}
