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

public class Display {

    private static void swap(long[]x,int i,int j){long temp = x[i]; x[i] = x[j]; x[j] = temp;}

    private static void sort(long[]x,int n){
	for (int i=n-1;i>0;i--)
	    for (int j=0;j<i;j++)
		if (x[j] < x[j+1]) swap(x,i,j);
    }

    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){
	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){
	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){
	sort(x,n);
	return x[n/2];
    }

    private static long min(long[]x,int n){
	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){
	long max = x[0];
	for (int i=1;i<n;i++) max = Math.max(max,x[i]);
	return max;
    }

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

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

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