//
// Analyse algorithm
// model time, solve time, total time, model size
//
import java.util.*;
import java.io.*;

public class AnalyseAlg {

    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 average(double[]x){
	int n = x.length;
	double 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(String alg,int nlo,int nhi,int inc,int lwb,int upb) throws IOException {
	String fname = "";
	String skip = "";
	int count = 0;
	for (int n=nlo;n<=nhi;n=n+inc){
	    count = 0;
	    long [] nodes     = new long[upb-lwb+1];
	    long [] modelTime = new long[upb-lwb+1];
	    long [] solveTime = new long[upb-lwb+1];
	    long [] totalTime = new long[upb-lwb+1];
	    long [] modelSize = new long[upb-lwb+1];
	    int matched = 0;
	    for (int i=lwb;i<=upb;i++){
		if (i < 10)
		    fname = "../randomResults/"+ alg +"-"+ n +"-0"+ i +".txt";
		else
		    fname = "../randomResults/"+ alg +"-"+ n +"-"+ i +".txt";
		Scanner sc = new Scanner(new File(fname));
		skip = sc.next(); // solutions:
		sc.nextInt();     // solutions
		skip = sc.next(); // nodes:
		nodes[count] = sc.nextInt();
		skip = sc.next(); // modelTime:
		modelTime[count] = sc.nextInt();
		skip = sc.next(); // solveTime:
		solveTime[count] = sc.nextInt();
		skip = sc.next(); // totalTime: 
		totalTime[count] = sc.nextInt();
		skip = sc.next(); // modelSize
		modelSize[count] = sc.nextInt();
		sc.close();
		count++;
	    }	
	    System.out.print(n);
	    //System.out.print(" "+ average(modelTime) +" "+ min(modelTime) +" "+ median(modelTime) +" "+ max(modelTime));
	    //System.out.print(" "+ average(solveTime) +" "+ min(solveTime) +" "+ median(solveTime) +" "+ max(solveTime));
	    System.out.print(" "+ average(totalTime) +" "+ min(totalTime) +" "+ median(totalTime) +" "+ max(totalTime));
	    //System.out.print(" "+ average(nodes) +" "+ min(nodes) +" "+ median(nodes) +" "+ max(nodes));
	    //System.out.print(" "+ average(modelSize) +" "+ min(modelSize) +" "+ median(modelSize) +" "+ max(modelSize));
	    System.out.println();
	}
    }

    public static void main(String[] args) throws IOException {
	String alg = args[0];
	int nlo    = Integer.parseInt(args[1]); // number of agents
	int nhi    = Integer.parseInt(args[2]); // number of agents
	int inc    = Integer.parseInt(args[3]);
	int lwb    = Integer.parseInt(args[4]); // index of 1st results file
	int upb    = Integer.parseInt(args[5]); // index of last results file
	stats(alg,nlo,nhi,inc,lwb,upb);
    }
}