#include<cstdio>
#include<cstdlib>
using namespace std;
int m,n,list[30001],top=0;
short Get[30001];
int cmp(const void *a,const void *b)
{
	return *(int *)a - *(int *)b;
}
int main()
{
	freopen("blackbox.in","r",stdin);
	freopen("blackbox.out","w",stdout);
	scanf("%d%d",&m,&n);
	int i;
	for(i=0;i<m;i++)
		scanf("%d",&list[i]);
	for(i=0;i<n;i++)
	{
		scanf("%d",&Get[i]);
	}
	i=0;
	int top=-1,p=0;
	while(i<m)
	{
		if(Get[p]!=i)
		{
			i++;
		}
		else
		{
			qsort(list,i,sizeof(list[0]),cmp);
			printf("%d\n",list[++top]);
			p++;
		}
	}
	return(0);
}