#include<fstream>
using namespace std;
int M,N,i,j,s[30001],b[30001],c[15001];
int Div(int a[],int left,int right)
{
	int base=a[left];
	while(left<right)
	{
		while(left<right&&a[right]>base)
			--right;
		a[left]=a[right];
		while(left<right&&a[left]<base)
			++left;
		a[right]=a[left];
	}
	a[left]=base;
	return left;
}
void quicksort(int a[],int left,int right)
{
	int i;
	if(left<right)
	{
		i=Div(a,left,right);
		quicksort(a,left,i-1);
		quicksort(a,i+1,right);
	}
}
int main()
{
	ifstream cin("blackbox.in");
	ofstream cout("blackbox.out");
	cin>>M>>N;
	for(i=1;i<=M;i++)
		cin>>b[i];
	for(i=1;i<=N;i++)
		cin>>c[i];
	j=1;
	for(i=1;i<=M;i++)
	{
		s[i]=b[i];
		if(c[j]==i)
		{
			quicksort(s,1,i);
			cout<<s[j]<<endl;
			j++;
			for(int x=j;x<=N;x++)
			{
				if(c[x]==i)
					cout<<s[j]<<endl;
				else
					break;
			}
		}
	}
	return 0;
}