program bricks;
var f1:text;
    k,i,g,j,x,nomer,sum,stolb,c,d:integer;
    h,summ:real;
    s:array [1..100] of string;
    chisla:array[1..50] of integer;
    chis,s1:string;
begin
     assign(f1,'bricks.in');
     reset(f1);
     k:=1;
     nomer:=1;
     while not seekeof(f1) do
        begin
           read(f1,s[k]);
           k:=k+1;
        end;
     k:=1;
     x:=0;
     while s[k]<>'0' do
       begin
          k:=k+1;
          x:=x+1;
       end;
     for i:=1 to x do
         if i mod 2 = 1
            then val(s[i],stolb,c)
            else
                begin
                     g:=1;
                     
                     chis:='';
                     s1:=s[i];
                     for d:=1 to length(s[i]) do
                        begin
                           if s1[d]<>' '
                           then
                                chis:=chis+''+s1[d]
                           else
                           begin
                           val(chis,chisla[g],c);
                           g:=g+1;
                           chis:=''
                           end;
                           if d=length(s[i])
                           then
                           begin
                           val(chis,chisla[g],c);
                           chis:='';
                           end
                        end;
                     sum:=0;

                     for k:=1 to g do
                         sum:=sum+chisla[k];
                     h:=sum/stolb;
                     summ:=0;
                     for k:=1 to g do
                       begin
                         if chisla[k]>h
                            then summ:=summ+chisla[k]-h;
                         chisla[k]:=0;
                       end;
                     writeln('Набор #',nomer);
                     writeln('Минимальное количество перемещений - ',summ:1:0,'.');
                     writeln;
                     nomer:=nomer+1;
                end;

        close(f1);
end.