#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define inf -0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define mem(a, b) memset(a, b, sizeof(a))
typedef long long ll;
const int maxn=2*10001;
struct Node{
Node *ch[2];
int s;
int r;
int v;
Node(int v):v(v){ch[0]=ch[1]=NULL;r=rand();s=1;}
int cmp(int x) const{
if(x==v)
return -1;
return x<v?0:1;
}
void maintain(){
s=1;
if(ch[0]!=NULL)
s+=ch[0]->s;
if(ch[1]!=NULL)
s+=ch[1]->s;
}
};
void rotate(Node* &o,int d){
Node* k=o->ch[d^1];
o->ch[d^1]=k->ch[d];
k->ch[d]=o;
o->maintain();
k->maintain();
o=k;
}
void insert(Node* &o,int x){
if(o==NULL)
o=new Node(x);
else{
int d=x < o->v ? 0:1;
insert(o->ch[d],x);
if(o->ch[d]->r>o->r)
rotate(o,d^1);
}
o->maintain();
}
void remove(Node* &o,int x){
int d=o->cmp(x);
if(d==-1){
if(o->ch[0]==NULL)
o=o->ch[1];
else if(o->ch[1]==NULL)
o=o->ch[0];
else{
int d2=(o->ch[0]->r>o->ch[1]->r? 1:0);
rotate(o,d2);
remove(o->ch[d2],x);
}
}
else
remove(o->ch[d],x);
if(o!=NULL)
o->maintain();
}
int kth(Node* o,int k){
if(o==NULL||k<=0||k>o->s)
return 0;
int s=(o->ch[1]==NULL?0:o->ch[1]->s);
if(k==s+1)
return o->v;
else if(k<=s)
return kth(o->ch[1],k);
else return kth(o->ch[0],k-s-1);
}
void removetree(Node* &x){
if(x->ch[0]!=NULL)
removetree(x->ch[0]);
if(x->ch[1]!=NULL)
removetree(x->ch[1]);
delete x;
x=NULL;
}
bool find(Node *o,int x)
{
while(o!=NULL)
{
int d=o->cmp(x);
if(d==-1) return true;
o=o->ch[d];
}
return false;
}
void Print(Node *t) {
if(t==NULL) return;
Print(t->ch[0]);
cout<<t->v<<endl;
Print(t->ch[1]);
}
int val[1000005];
int main()
{
int n,x,m;
while(~scanf("%d%d",&n,&m)){
for(int i=1; i<=n; i++)
scanf("%d",&val[i]);
int index=1;
Node *root=NULL;
for(int i=1; i<=m; i++){
scanf("%d",&x);
for(int j=index; j<=x; j++)
insert(root,val[j]);
index=x+1;
printf("%d\n",kth(root,x-i+1));
}
removetree(root);
}
return 0;
}