program main;
type
  arr = array [1..1000] of longint;

var i, n, t, sum : longint;
    juice : arr;

procedure quicksort (var number : arr; left, right : longint);
var
  l, r, t, tswap : longint;

begin
  l := left;
  r := right;
  t := number[l];
  repeat
    while (number[l] < t) and (l < right) do 
      inc(l);
    while (number[r] >= t) and (r > left) do 
      dec(r);
    if (l < r) then begin
     tswap := number[l];
     number[l] := number[right];
     number[r] := tswap;     
    end;
  until (l >= r);
  quicksort(number, left, r);
  quicksort(number, (r+1), right);
end;

begin
  read(n);
  readln(t);
  for i := 1 to n do
    read(juice[i]);
  readln;
  quicksort(juice, 1, n);
  sum := 0;
  for i := 1 to t do
    sum := sum + juice[i];
  writeln(sum);
end.