#include <bits/stdc++.h>
using namespace std;
int n, k, p;
long long int input[100010];
int main() {
  int i;
  long double sum = 0, ans = 0;
  scanf("%d %d %d", &n, &k, &p);
  for (i = 1; i <= n; i++) {
    scanf("%lld", &input[i]);
    sum += input[i];
  }
  sort(input + 1, input + n + 1);
  for (i = 1; i <= n; i++) {
    long long ma = (long long)(n - i + 1) * k;
    ma = min(ma, (long long)p);
    ans = max(ans, (sum + ma) / (long double)(n - i + 1));
    p--;
    sum -= input[i];
    if (p == -1) break;
  }
  cout << fixed << setprecision(20) << ans;
}
