#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
long long A[N], B[N];
int main() {
  long long n, k, m;
  cin >> n >> k >> m;
  for (int i = 1; i <= n; ++i) cin >> A[i];
  sort(A + 1, A + 1 + n);
  for (int i = n; i >= 1; --i) B[i] = A[i] + B[i + 1];
  double ans = (B[1] * 1.0 + min(n * k, m)) / n;
  for (int i = 2; i <= min(n, m + 1); ++i) {
    ans =
        max(ans, (B[i] * 1.0 + min((n - i + 1) * k, m - i + 1)) / (n - i + 1));
  }
  printf("%.10lf\n", ans);
}
