#include <bits/stdc++.h>
using namespace std;
int n, k, m;
int a[100001];
int main() {
  cout << setprecision(10);
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k >> m;
  long long sum = 0;
  for (int i = 1; i <= n; i++) cin >> a[i], sum += a[i];
  sort(a + 1, a + 1 + n);
  long double ret = 0;
  long long sumd = 0;
  for (int i = 0; i <= min(n - 1, m); i++) {
    sumd += a[i];
    long long ops = min((long long)m - i, (long long)k * (n - i));
    long long tot = sum - sumd + ops;
    ret = max(ret, (long double)tot / (n - i));
  }
  cout << ret;
  return 0;
}
