#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3fffffff;
double eps = 1e-8;
double pi = acos(-1);
const long long mod = 1000;
long long quick_pow(long long x, long long n) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % mod;
    x = x * x % mod;
    n >>= 1;
  }
  return res;
}
int n, k, m;
bool cmp(int a, int b) { return a > b; }
const int maxn = 100005;
int a[maxn];
long long sum[maxn];
double check(int i) {
  int deleted = n - i;
  double temp = min((long long)m - deleted, (long long)i * k);
  double ans = sum[i] + temp;
  return ans / i;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> k >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1, cmp);
  for (int i = 1; i <= n; i++) {
    sum[i] = sum[i - 1] + a[i];
  }
  double ans = 0;
  for (int i = max(1, n - m); i <= n; i++) {
    ans = max(ans, check(i));
  }
  cout << fixed << setprecision(10) << ans << endl;
}
