#include <bits/stdc++.h>
using namespace std;
long long modulo(long long base, long long exp, long long m);
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m, k;
  cin >> n >> k >> m;
  double avg = 0;
  vector<long long> v(n), pre(n + 1);
  for (long long i = 0; i < n; i++) {
    cin >> v[i];
    avg += v[i];
  }
  avg /= n;
  sort(v.begin(), v.end());
  pre[n] = 0;
  for (long long i = n - 1; i >= 0; i--) {
    pre[i] = pre[i + 1] + v[i];
  }
  double ans = avg;
  for (long long i = 0; i < n && m > -1; i++) {
    double tmp = pre[i] + min((n - i) * k, m);
    if (n > i) tmp /= (n - i);
    ans = max(ans, tmp);
    m--;
  }
  cout << setprecision(20) << fixed;
  cout << ans;
  return 0;
}
long long modulo(long long base, long long exp, long long m) {
  long long answer = 1;
  while (exp > 0) {
    if (exp % 2 == 1) answer = (answer * base) % m;
    exp = exp / 2;
    base = (base * base) % m;
  }
  return answer;
}
