Program transport;
var n,k,i,suma,max,pivot,sp,aux : longint;
    stiva,D : array[1..20000] of longint;
begin
    assign(input,'transport.in'); reset(input);
    assign(output,'transport.out'); rewrite(output);
    readln(n,k); max:=0;
    for i:=1 to n do begin
                           read(stiva[i]);
                           suma:=suma+stiva[i];
                     end;
    aux:=suma div k;
    stiva[n+1]:=aux;
    i:=1;
    while (suma>0) do begin
                         pivot:=pivot+1;
                         while D[pivot]<aux do begin
                                                 D[pivot]:=D[pivot]+stiva[i];
                                                 i:=i+1;
                                                end;
                         suma:=suma-D[pivot];
                      end;
    D[pivot]:=D[pivot]-aux;
    for i:=1 to pivot do
        if D[i]>max then max:=D[i];
    writeln(max);
    close(input);
    close(output);
end.