import java.util.*;
import java.io.*;

public class AnalyseSRI {

    private static void show(long[]x){
	int n = x.length;
	for (int i=0;i<n;i++) System.out.print(x[i] + " ");
	System.out.println();
    }

    private static long sum(long[]x){
	int n = x.length;
	long sum = 0;
	for (int i=0;i<n;i++) sum = sum + x[i];
	return sum;
    }

    private static long average(long[]x){
	int n = x.length;
	long sum = 0;
	for (int i=0;i<n;i++) sum = sum + x[i];
	return sum/n;
    }

    private static double geometricMean(long[]x){
	int n = x.length;
	double logSum = 0.0;
	for (int i=0;i<n;i++) logSum = logSum + Math.log((double)x[i]);
	return Math.exp(logSum/(double)n);
    }

    private static long median(long[]x){
	int n = x.length;
	Arrays.sort(x);
	return x[n/2];
    }

    private static long min(long[]x){
	int n = x.length;
	long min = x[0];
	for (int i=1;i<n;i++) min = Math.min(min,x[i]);
	return min;
    }
    
    private static long max(long[]x){
	int n = x.length;
	long max = x[0];
	for (int i=1;i<n;i++) max = Math.max(max,x[i]);
	return max;
    }

     private static double average(double[]x){
	int n = x.length;
	double sum = 0.0;
	for (int i=0;i<n;i++) sum = sum + x[i];
	return sum/n;
    }

     private static double median(double[]x){
	 int n = x.length;
	 Arrays.sort(x);
	 return x[n/2];
     }

    private static double min(double[]x){
	int n = x.length;
	double min = x[0];
	for (int i=1;i<n;i++) min = Math.min(min,x[i]);
	return min;
    }
    
    private static double max(double[]x){
	int n = x.length;
	double max = x[0];
	for (int i=1;i<n;i++) max = Math.max(max,x[i]);
	return max;
    }

    private static void skip(Scanner sc,int n){for (int i=0;i<n;i++) sc.next();}

    private static void stats(Scanner sc,int n,double p,int m) throws IOException {
	long[] solutions = new long[m]; // number of solutions instance by instance
	double sat       = 0.0; // how many instances had matchings
	double[] pSol    = new double[m];
	double[] N       = new double[m];
	double[] E       = new double[m];
	double[] kappa   = new double[m];
	for (int i=0;i<m;i++){
	    //Scanner sc = new Scanner(new File(fname));
	    //skip(sc,2); // n: dd
	    //skip(sc,2); // p: 0.ddd
	    //skip(sc,2); // inst: dd
	    //skip(sc,2); // components
	    skip(sc,1); // solutions:
	    solutions[i] = sc.nextLong();
	    if (solutions[i] > 0) sat = sat + 1.0;
	    skip(sc,24);
	}
	//System.out.print(n +" "+ edges +" ");
	System.out.format("%d  %.3f ",n,p);
	System.out.print((sat/m) +" ");
	System.out.print(((double)sum(solutions)/(double)m) +" "+ min(solutions) +" "+ median(solutions) +" "+ max(solutions) +" ");
	System.out.println();
    }

    public static void main(String[] args) throws IOException {
	Scanner sc  = new Scanner(new File(args[0]));
	int n       = Integer.parseInt(args[1]); // agents
	double pLo  = Double.parseDouble(args[2]); 
	double pHi  = Double.parseDouble(args[3]);
	double pInc = Double.parseDouble(args[4]);
	int m       = Integer.parseInt(args[5]); // sample size
	double p    = pLo; // (1.0-p) from SM (p=0 <-> SM), p from SR (p=1 <-> SR)

	while (p < pHi+pInc){
	    stats(sc,n,p,m);
	    p = p + pInc;
	}
    }
}