program aa;
var
a,b,c,d,e,f,g,g1,g2,i,j,n,m,sum,max:longint;
l1:array[1..30000]of longint;
l2:array[1..30000]of longint;
l:array[1..30000]of longint;
f1,f2:text;
{*********************************}
    procedure sort(t,r: longint);
      var
         i,j,x,y: longint;
      begin
         i:=t;
         j:=r;
         x:=l[(t+r) div 2];
         repeat
           while l[i]<x do
            inc(i);
           while x<l[j] do
            dec(j);
           if not(i>j) then
             begin
                y:=l[i];
                l[i]:=l[j];
                l[j]:=y;
                inc(i);
                j:=j-1;
             end;
         until i>j;
         if t<j then
           sort(t,j);
         if i<r then
           sort(i,r);
      end;
{*********************************}
procedure get;
begin
inc(i);
writeln(f2,l[i]);
end;
{*********************************}
procedure add(k:longint);
var
d,j,jj:integer;
begin
inc(a);
l[a]:=k;
sort(1,a);
end;
{*********************************}
begin
assign(f1,'blackbox.in');
assign(f2,'blackbox.out');
reset(f1);
rewrite(f2);
readln(f1,n,m);
for i:=1 to n do
read(f1,l1[i]);
readln(f1);
for i:=1 to m do
read(f1,l2[i]);
a:=0;b:=1;c:=1;
i:=0;
for g:=1 to n do
begin
add(l1[g]);
for g1:=b to m do
if l2[g1]=g then
get;
end;
close(f1);close(f2);
end.