uses kfree;

const MAXN = 100000;
var N, K : longint;
    insieme : array[0..MAXN-1] of longint;
    i : longint;
    fr, fw : text;

begin
    assign(fr, 'input.txt');
    assign(fw, 'output.txt');
    reset(fr);
    rewrite(fw);

    readln(fr, N, K);
    for i:=0 to N-1 do read(fr, insieme[i]);
    close(fr);

    writeln(fw, Trova(N, K, insieme));
    close(fw);
end.