https://codeforces.com/contest/1111/problem/B
/*
*@Author: STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
ll ans,cnt,flag,temp,sum;
int a[N];
int add[N];
char str;
int main()
{
#ifdef DEBUG
freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
#endif
scanf("%d%d%d",&n,&k,&m);
//scanf("%d",&t);
//while(t--){}
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
sum+=a[i];
}
sort(a+1,a+n+1);
int l=1;
int r=n;
while(m--&&l<=r){
if(l<r&&a[l]==a[r]&&n-l+1<=m){
sum-=a[l];
l++;
continue;
}
if(l==r){
if(add[r]<k){
add[r]++;
a[r]++;
if(add[r]==k)
r--;
sum++;
}
continue;
}//cout << (double)(sum-a[l])/(n-l)<<" "<<(sum+1)/(double)(n-l+1)<< endl;
if((sum-a[l])/(double)(n-l)>(sum+1)/(double)(n-l+1)){
sum-=a[l];
l++;
}else{
add[r]++;
a[r]++;
if(add[r]==k)
r--;
sum++;
}
}
printf("%.12lf\n",(double)sum/(n-l+1));
//
//cout << "Hello world!" << endl;
return 0;
}