BEGIN{
    FS=","
    OFS=","
    i=0;
    j=0;
    minCost=0;
    minAtt=0;
    maxcost=-1;
    maxAtt=-1;
    while ((getline < TF) > 0)
	time[i++]=$0;
    getline < BL;
    getline < BL;
    maxCost=$(NF-1);
    maxAtt=$NF;
}

NR>1{results[j++]=$0}

END{
    for (k=0; k<j; k++)
	print results[k],maxCost,maxAtt,time[k],maxTime;
}