#include <bits/stdc++.h>
using namespace std;
long long n, k, m, a[100005], s[100005];
long double ans;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> m;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; ++i) {
    s[i] = s[i - 1] + a[i];
  }
  for (int i = 0; i <= min(m, n - 1); ++i) {
    long long sum = s[n] - s[i];
    long long t = m - i;
    t = min(t, 1ll * (n - i) * k);
    sum += t;
    ans = max(ans, (long double)sum / (n - i));
  }
  cout.precision(10);
  cout << fixed << ans;
}
