#include <bits/stdc++.h>
using namespace std;
int mod = 1000000000 + 7;
const int N = 102000;
const double PI = acos(-1);
long long a[N];
int main() {
  long long n, k, m;
  cin >> n >> k >> m;
  double sum = 0;
  double res = n;
  for (int i = 0; i < n; i++) {
    scanf("%lld", &a[i]);
    sum += a[i];
  }
  sort(a, a + n);
  double mx = 0;
  for (int i = 0; i < n; i++) {
    double tmp = sum + min(m, k * (n - i));
    mx = max(mx, tmp / res);
    sum -= a[i];
    res--;
    m--;
    if (m == -1) break;
    if (res == 0) break;
  }
  printf("%.10f", mx);
  return 0;
}
