#include <stdio.h>
#include <ctype.h>

int id= -1,n,k;

int val[201];
struct depo {
     int rest;
     int pos;
} dep[200];

int depot[200];
int rest[200];
int min, ming = 32766;

void visit(int);
int distmin();
int main(void)
{
     FILE *fin, *fout;
     int t;
     int first, second,i,j;
     
     t =1;
     fin = fopen("fastfood.in", "r");
     fout = stdout;
     while(fscanf(fin,"%d%d",&n,&k) && n != 0 && k != 0) {
	  id = -1;
	  ming = 32766;
	  for(i = 0; i <= 200; i++)
	       val[i]=0;
	  for(i = 0; i<n;i++)
	       fscanf(fin,"%d",&rest[i]);
	  
	  
	  visit(0);
	  fprintf(fout,"Chain %d\n",t);
	  i = 0;
	  for(j = 0; j < k; j++)
	       if(i < n -1) {
		    if(depot[i] == depot[i+1]) {
			 first = i+1;
			 while(i < n-1) {
			      if (depot[i] == depot[i+1])
				   i++;
			      else {  
				   break;
			      }
			 }
			 second = i + 1;
			 fprintf(fout,"Depot %d at resturant %d serves restaurants %d to %d\n",j+1,depot[second-1]+1,first,second);
			 i++;
		    }
		    else {
 			 fprintf(fout,"Depot %d at resturant %d serves restaurant %d\n",j+1,depot[i]+1,depot[i]+1);
			 i++;
		    }
	       }
	       else
		    fprintf(fout,"Depot %d at resturant %d serves restaurant %d\n",j+1,depot[i]+1,depot[i]+1);
	  fprintf(fout,"Total distance sum = %d\n\n",ming);
     }
     return 0;
}

void visit(int h) {
     
     int t,m;
     int j;
     val[h] = ++id;
     if(id == n) 
	  if( (m = distmin()) < ming) {
	       ming = m;
	       for(j = 0; j < n; j++)
		    depot[j] = dep[j].pos;
	  }
     for(t = 1; t <= n; t++)
	  if(val[t] == 0) visit(t);
     id--;
     val[h] = 0;
}
    
int distmin() {
  int i,j;
  for(i = 0; i<n; i++) {
       dep[i].rest = rest[val[1]];
       dep[i].pos = val[1];  
       for(j = 2; j<= k; j++)
	    if(abs(dep[i].rest-rest[i]) > abs(rest[i]-rest[val[j]])) {
		 dep[i].rest  = rest[val[j]];
		 dep[i].pos = val[j]; 
	    }
  }
  min = 0;
  for(i = 0; i< n; i++)
       min += abs(rest[i]-dep[i].rest);
  return min;
}