#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e7 + 7;
const long long inf = 1e17 + 9;
long long power(long long a, long long b, long long p) {
  long long ans = 1;
  while (b) {
    if (b & 1) {
      ans = (ans * a) % p;
    }
    a = (a * a) % p;
    b >>= 1;
  }
  return ans;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, k, m, val, sum = 0, bn, bd, cn, cd;
  vector<long long> v;
  cin >> n >> k >> m;
  for (long long i = 0; i < n; i++) {
    cin >> val;
    v.push_back(val);
    sum += val;
  }
  sort(v.begin(), v.end());
  bn = 0;
  bd = 1;
  for (long long i = 0; i < n and m >= 0; i++) {
    cd = n - i;
    cn = sum + min(k * cd, m);
    if (cn * bd > cd * bn) {
      bd = cd;
      bn = cn;
    }
    m--;
    sum -= v[i];
  }
  cout << fixed << setprecision(10) << (long double)(bn) / bd << endl;
  return 0;
}
