#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;




int distanceOfVent(int vi, int vj){
  int d;


  d =(int) fabs(vi-vj);




  return d;

}


int main(){
  string room;
  int number, vent, median, sumOfDistance[10];
  int optimalVent, a, b;
  vector<int> vents;

  while(cin >> room >> number){

    for(int k=0;k<10;k++){
      sumOfDistance[k]=0;
    }

    
    for(int i =0; i<number;i++){
      cin >> vent;
      vents.push_back(vent);
    }


    for(int i=0;i<vents.size();i++){

	for(int j=0;j<vents.size();j++){
	  if(i!=j){
	    sumOfDistance[i] = sumOfDistance[i]+distanceOfVent(vents[i],vents[j]);
	   

	  
	  }
	}
      }

    optimalVent=0;
    for(int k =0;k<vents.size();k++){

      if(sumOfDistance[k] <= sumOfDistance[optimalVent]){
 
	if(vents[k]<vents[optimalVent] || sumOfDistance[k]<sumOfDistance[optimalVent]){

	  optimalVent=k;
	}
	  
      }
    }


    cout << room << " " << vents[optimalVent] << " " <<sumOfDistance[optimalVent] << endl;
    vents.clear();
  }

  return 0;

}