Бинарный поиск чисел в массиве

uses sysutils;
 
var x,y:array[1..1000] of longint;
    m, n, a, i ,j,temp, left, right, middle:integer;
flag:boolean;
kek: byte;
 
begin
for kek:=1 to 20 do writeln(' ');
readln(n);
readln(m);
  for i:=1 to n do begin
  read(x[i]);
  end;
 
  for j:=1 to m do begin
  read(y[j]);
  end;
 
left:=1;
right:= n;
flag:=false;
  while (left <= right) and not flag do
  begin
    middle:=(left+right) div 2;
    if y[j]<x[middle] then right:=middle-1
    else if y[j]>x[middle] then left:=middle+1
    else flag:=true;
  end;
if not flag then writeln('-1')
else writeln(y[j]);
end.

  ReadLn(m,n);
  for i:=1 to n do Read(x[i]);
  for i:=1 to m do begin
    Read(y);
    {бинарный поиск первого вхождения y в массиве x}
    if нашли then Write(' ',left) else Write(' ',-1);
  end; WriteLn;

var
  a: array [0..99999] of Integer;
  m, n, i, b, lt, rt, md: Integer;
begin
  Read(m,n);
  for i:=0 to m-1 do Read(a[i]);
  for i:=1 to n do begin
    Read(b); lt:=0; rt:=m;
    while lt<rt do begin
      md:=lt+(rt-lt) div 2;
      if a[md]<b then lt:=md+1 else rt:=md;
    end;
    if (lt<m) and (a[lt]=b) then Write(' ',lt+1) else Write(' ',-1);
  end; WriteLn;
end.

var
  a: array [1..100000] of Integer;
  m, n, i, b, lt, rt, md: Integer;
begin
  Read(m,n);
  for i:=1 to m do Read(a[i]);
  for i:=1 to n do begin
    Read(b); lt:=1; rt:=m+1;
    while lt<rt do begin
      md:=lt+(rt-lt) div 2;
      if a[md]<b then lt:=md+1 else rt:=md;
    end;
    if (lt<=m) and (a[lt]=b) then Write(' ',lt) else Write(' ',-1);
  end; WriteLn;
end.