program ggg;
uses crt;
const MaxN=100;
var n,cne,cnm:integer;
type MyArray=Array[1..MaxN] of integer;
function Search(n,k:integer; X :MyArray):integer;
var i,cnl,sne,snm,q:integer;
sl,se,sm: Myarray;
BEGIN
if n=1 then search:=x[1]
else begin
FillChar(sl,sizeof(sl),0);
FillChar(se,sizeof(se),0);
FillChar(sm,sizeof(sm),0);
cnl:=0;
sne:=0;
snm:=0;
q:=integer(random(n))+1;
for i:=1 to n do
if x[i] inc(cnl);sl[cnl]:=x[i];
end
else if x[i]=x[q] then begin
inc(cne);se[cne]:=x[i]; end
else begin
inc(cnm);sm[cnm]:=x[i];
end;
if cnl>=k then search:= search(cnl,k,sl)
else if cnl+cne>=k then search:=x[q]
else search:=search(cnm,n-cnl-cne,sm);
end;
end.