TOKI PROBLEM C - CHAP 12

var
    A,C,D: Array[1..100000] of string;
    spasi : string;
    N , Q , i , hasil,kiri,kanan,tengah: longint;
begin
    readln (N,Q);
    spasi := ' ' ;
    for i := 1 to N do begin
        readln (A[i]);
        D[i] := copy  (A[i], (pos (spasi,A[i]) + 1), 6); // separating string
        delete ( A[i] , pos ( spasi , A[i] ) , 7);
    end;

    for i := 1 to Q do begin
        readln (C[i]);
    end;
    // Binary Search begins
    for i := 1 to Q do begin
        kiri := 1;
        kanan := N ;
        hasil := 0 ;
        while ( kiri <= kanan ) and ( hasil = 0 ) do begin
            tengah := ( kiri  + kanan ) div 2;
            if ( C[i] < A[tengah] ) then begin
                kanan := tengah - 1;
            end else if ( C[i] > A[tengah] ) then begin
                kiri := tengah + 1;
            end else begin
                hasil := tengah;
            end;
        end;
    // Binary Search ends
        if ( hasil = 0 ) then begin
            writeln ('NIHIL');
        end else begin
            writeln (D[tengah]);
        end;
    end;
end.