#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int M = 1e9 + 7;
int mul(int a, int b) { return (long long int)a * b % M; }
int power(int a, int b) {
  if (b == 0) return 1;
  int temp = power(a, b / 2);
  if (b % 2 == 0)
    return mul(temp, temp);
  else
    return mul(a, mul(temp, temp));
}
int inv(int v) { return power(v, M - 2); }
long long int arr[100004], c[100004];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, k, m;
  cin >> n >> k >> m;
  for (int i = 0; i < n; i++) cin >> arr[i];
  sort(arr, arr + n);
  c[n - 1] = arr[n - 1];
  for (int i = n - 2; i >= 0; i--) {
    c[i] = arr[i] + c[i + 1];
  }
  double maxi = 0;
  if (n == 1) {
    maxi = arr[0] + min(k, m);
  }
  for (int i = 0; i < n - 1; i++) {
    if (m > 0) {
      long long int j = (n - i) * k;
      long long int j1 = (n - i - 1) * k;
      long long int mini = min(j, m), min2 = min(j1, m - 1);
      maxi = max(maxi, max((double)(c[i] + mini) / (n - i),
                           (double)(c[i + 1] + min2) / (n - i - 1)));
      m--;
    }
  }
  cout << fixed << setprecision(7) << maxi << endl;
}
