#include <stdlib.h>
#include <stdio.h>
#include <math.h>

int compare( const void* a, const void* b)
{
	int int_a = * ( (int*) a );
	int int_b = * ( (int*) b );

	if ( int_a < int_b ) return -1;
	else if ( int_a > int_b ) return 1;
	else return 0;
}

int main(int argsc, char ** args){
	if (argsc!=4){
                fprintf(stderr,"Invalid or no arguments.\n");
                exit(1);
        }
	int si = atoi(args[1]); /*simulation time*/
	double sa = atof(args[2]); /*sample time*/
	int lastOne = atoi(args[3]); /*indication that there is a one more sample*/
	int count = (int)floor(si/sa) + lastOne;
	int index = 0;
	int sample;
	int * samples = malloc(count*sizeof(int));
	while(scanf("%d",&sample)!=EOF){
		if (index<count){
			samples[index++] = abs(sample);
		}else{
			fprintf(stderr,"number of samples exceedes precomupted value\n");
			free(samples);
			return 1;
		}
	}
	if (index!=count){
		fprintf(stderr,"number of samples lower then precomupted value\n");
		free(samples);
		return 2;
	}
	qsort(samples,count,sizeof(int),compare);

	unsigned cols = 5;
	double percentages[]={5,2,1,0.5,0.1};
	/* proceed for all the choosen percentages */
	for (int c=0; c<cols;c++){
		double p=percentages[c];
		int size=floor( ((double)p)/100*count);
		/*fprintf(stderr,"percent=%d, start=%d\n",p,start);*/
		unsigned long sum=0;
		for (int i=count-size;i<count;i++){
			sum+=samples[i];
		}
		printf("%.2lf %d\n",p,(int)(floor(((double)sum)/size)));
	}
	/*for (index=0;index<count;index++){
		printf("%d\n",samples[index]);
	}*/
	free(samples);
	return 0;
}