#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void gn(T &x) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), x = 0; c >= '0' && c <= '9';
       c = getchar())
    x = (x << 1) + (x << 3) + c - '0';
  if (sg) x = -x;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int a[100010];
long long sum[100010];
int main() {
  int n, m, k;
  cin >> n >> k >> m;
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  sort(a + 1, a + n + 1);
  for (int i = n; i; i--) sum[i] = sum[i + 1] + a[i];
  double ans = (double)(sum[1] + min((long long)m, (long long)k * n)) / n;
  for (int i = 1; i < n; i++) {
    int x = n - i;
    int M = min((long long)m - i, (long long)k * x);
    if (M < 0) continue;
    ans = max(ans, (double)(sum[i + 1] + M) / x);
  }
  printf("%.10lf\n", ans);
}
