#include <bits/stdc++.h>
using namespace std;
int a[100005], n, k, m;
double s;
double power(int i) {
  if ((long long)(n - i) * k <= m)
    return (s + (long long)(n - i) * k) / (n - i);
  else
    return (s + m) / (n - i);
}
int main() {
  int i;
  s = 0;
  cin >> n >> k >> m;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    s += a[i];
  }
  double Max = (s + min((long long)n * k, (long long)m)) / n;
  sort(a + 1, a + n + 1);
  for (i = 1; i <= n - 1; i++) {
    s -= a[i];
    m--;
    Max = max(Max, power(i));
    if (m <= 0) break;
  }
  printf("%.12lf\n", Max);
  return 0;
}
