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

public class AnalyseSM {

    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 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 void stats(int n,int pEdge,int pForbidden,int lwb,int upb) throws IOException {
	int count        = 0;
	String fname     = "";
	long[] nodes     = new long[upb-lwb+1]; // nodes visited
	long[] conflicts = new long[upb-lwb+1]; // conflicts
	long[] totalTime = new long[upb-lwb+1]; // milliseconds
	long[] size      = new long[upb-lwb+1]; // size of matching
	String P1        = Integer.toString(pEdge);
	String P2        = Integer.toString(pForbidden);
 
	if (pEdge < 10) P1 = "0" + P1;
	if (pForbidden < 10) P2 = "0" + P2;

	for (int i=lwb;i<=upb;i++){
	    if (i < 10)
		fname = "../smResults/"+ n +"-"+ P1 +"-"+ P2 +"-0"+ i +".txt";
	    else
		fname = "../smResults/"+ n +"-"+ P1 +"-"+ P2 +"-"+ i +".txt";
	    Scanner sc = new Scanner(new File(fname));
	    String buffer = sc.next();
	    while (!buffer.equals("nodes:")) buffer = sc.next();
	    nodes[count] = sc.nextLong(); sc.next(); 
	    conflicts[count]  = sc.nextLong(); sc.next();sc.next(); sc.next(); sc.next(); sc.next();
	    totalTime[count] = sc.nextLong(); sc.next(); sc.next(); sc.next(); sc.next(); sc.next();
	    size[count] = sc.nextLong();
	    count++;
	    sc.close();
	}
	System.out.format("%d  %.2f  %.2f ",n,((float)pEdge)/100.0,((float)pForbidden)/100.0);
	System.out.print(average(nodes) +" "+ min(nodes) +" "+ median(nodes) +" "+ max(nodes) +" ");
	System.out.print(average(conflicts) +" "+ min(conflicts) +" "+ median(conflicts) +" "+ max(conflicts) +" ");
	System.out.print(average(totalTime) +" "+ min(totalTime) +" "+ median(totalTime) +" "+ max(totalTime) +" ");
	System.out.print(average(size) +" "+ min(size) +" "+ median(size) +" "+ max(size) +" ");
	System.out.println();
    }

    public static void main(String[] args) throws IOException {
	int n          = Integer.parseInt(args[0]); // agents
	int pEdge      = Integer.parseInt(args[1]); // edge probability
	int pLo        = Integer.parseInt(args[2]); // forbidden probability
	int pHi        = Integer.parseInt(args[3]); // forbidden probability
	int pInc       = Integer.parseInt(args[4]); // increment for p
	int lwb        = Integer.parseInt(args[5]); // index of 1st results file
	int upb        = Integer.parseInt(args[6]); // index of last results file
     
	for (int p=pLo;p<=pHi;p=p+pInc)
	    stats(n,pEdge,p,lwb,upb);
    }
}