#include<iostream>
#include<algorithm>
using namespace std;
 double v,a[490001];
 long long i,n,m,j,fl;
int main()
{
    cin>>n>>m>>v;
    for (i=1;i<=n*m;i++){cin>>a[i];} 
    sort(a+1,a+n*m+1);
    while (1==1)
    {
       for(i=1;i<=n*m;i++)
       {
         if(a[i]!=a[i+1]){break;}                 
       }   
       if ((a[i+1]-a[i])*i<=v)
       {
         v=v-(a[i+1]-a[i])*i;
         for (j=1;j<=i;j++)
         {
            a[j]=a[i+1]; 
         }                    
       }
       else
       {
          
          v=v/i;
          for (j=1;j<=i;j++)
          {
             a[j]=a[j]+v; 
          } 
          fl=1;
       }
       if(fl==1){break;}
    }
    cout<<a[1]<<endl;
    return 0;
}
