#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, m, k, a[N];
long long rem, cnt, sum;
double ans;
int main() {
  cin >> n >> k >> m;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", a + i);
    sum += a[i];
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; ++i) {
    cnt = n - i + 1;
    rem = m - i + 1;
    if (rem < 0) {
      break;
    }
    ans = max(ans, (sum + min(rem, cnt * k)) * 1.0 / cnt);
    sum -= a[i];
  }
  printf("%0.9lf", ans);
  return 0;
}
