#include<bits/stdc++.h>
using namespace std;
priority_queue<int,vector<int>,greater<int> >s;
priority_queue<int,vector<int>,less<int> >b;
int a[50010],u[50010];
int main()
{
	int m,n;
	cin>>m>>n;
	for(int i=1;i<=m;i++) 
		cin>>a[i];
	for(int i=1;i<=n;i++) 
		cin>>u[i];
	int p=0;
	for(int i=1;i<=n;i++)
	{
		while(p<u[i])
		{
			p++;
			b.push(a[p]);
			s.push(b.top());
			b.pop();
		}
		cout<<s.top()<<endl;
		b.push(s.top());
		s.pop();
	}
	return 0;
}