#include <cstdio>
#include <algorithm>
using namespace std;
int hight[490010],n,m,v,plosht;
double nivo,proc,v2,plosht2,n2;
int main(){
    scanf("%d%d%d",&m,&n,&v);
    n=n*m;
    for (int i=0;i<n;++i){
        scanf("%d",&hight[i]);
    }
    sort(hight,hight+n);
    for (int i=0;i<n&&v>0;++i){
        plosht+=1;
        if (v>=(hight[i+1]-hight[i])*plosht){
            v-=(hight[i+1]-hight[i])*plosht;
            nivo+=hight[i+1]-hight[i];
        }
        else{v2=v;plosht2=plosht;nivo+=v2/plosht2;v=0;}
    }
    v2=v;plosht2=plosht;n2=n;
    nivo+=v2/plosht2;
    nivo+=hight[0];
    plosht2=0;
    for (int i=0;nivo>=hight[i];++i){
        ++plosht2;
    }
    proc=(plosht2/n)*100;
    printf("%.2lf %.2lf\n",nivo,proc);
    return 0;
}
