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

public class Analyse {

    private static void skip(MyIo fin,int n) throws IOException{
	for (int i=0;i<n;i++) fin.getNextString();
    }

    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 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 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 kappa(int n,int k,double p){
	double S      = Math.pow((double)k,(double)n);
	double logS   = Math.log(S);
	double psol   = Math.pow((double)(k-1)/(double)k,((double)n*(n-1))*p*0.5);
	double Sol    = S * psol;
	double logSol = Math.log(Sol);
	double kappa  = 1.0 - logSol/logS;
	return kappa;
    }

    private static void stats(int k,int n,int p,int lwb,int upb) throws IOException {
	int count        = 0;
	int sat          = 0;
	String fname     = "";
	long[] nds       = new long[upb-lwb+1]; // nodes visited
	long[] solveTime = new long[upb-lwb+1]; // milliseconds

	for (int i=lwb;i<=upb;i++){
	    if (i < 10)
		fname = "results/"+ k +"-"+ n +"-"+ p +"-0"+ i +".txt";
	    else
		fname = "results/"+ k +"-"+ n +"-"+ p +"-"+ i +".txt";
	    MyIo fin    = new MyIo(fname);
	    if (fin.getNextString().equals("true")) sat++;
	    nds[count]       = fin.getNextLong();
	    solveTime[count] = fin.getNextLong();
	    count++;
	    fin.close();
	}
	System.out.format("%d  %.2f  %d  ",n,((float)p)/100.0,k);
	System.out.print(average(nds) +" "+ min(nds) +" "+ median(nds) +" "+ max(nds) +" ");
	System.out.print(average(solveTime) +" "+ min(solveTime) +" "+ median(solveTime) +" "+ max(solveTime) +" ");
	System.out.print(((sat * 100)/count) +" ");
	System.out.format("%.2f",kappa(n,k,(double)p/100.0));
	System.out.println();
    }

    public static void main(String[] args) throws IOException {
	int n          = Integer.parseInt(args[0]); // vertices in a graph
	int k          = Integer.parseInt(args[1]); // number of colours
	int pLo        = Integer.parseInt(args[2]); // lwb edge probability
	int pHi        = Integer.parseInt(args[3]); // upb edge probability
	int lwb        = Integer.parseInt(args[4]); // index of 1st results file
	int upb        = Integer.parseInt(args[5]); // index of last results file
	
	for (int p=pLo;p<=pHi;p++)
	    stats(k,n,p,lwb,upb);
    }
}