program searchmin;
uses crt;
var
  d : array[1..1000] of integer;
  i,j,n,r : integer;
  wmin: array[1..1000] of integer;
begin
writeln('ile elementow ma miec zbior?');
readln(n);
writeln('ile najmniejszych pokazac');
readln(r);
if r>n then
        begin
        writeln('r musi byc mniejsze od n');
        end
else

repeat
        for i:=1 to n do
        begin
        writeln('podaj elementy');
	readln(d[i]);
        end;
        wmin[1] := d[1];
         for i := 2 to n do
                for j:=1 to r do
                        if (wmin[j] > d[i]) then
                        begin
                         wmin[j]:=d[i];
                          d[i]:=d[n];
                           n:=n-1;
                        end;

for j:=1 to r do
writeln(wmin[j]);
until i>r;
  readln;
end.