#include <iostream>
#include <cstdio>
using namespace std;
int n,m,x,y,a[100010],lg[100010],f[100010][20];
int main()
{
// freopen("s10.in","r",stdin);
// freopen("s10.out","w",stdout);
cin>>n>>m; lg[1]=0;
for (int i=2;i<=n;i++) lg[i]=lg[i>>1]+1;
for (int i=1;i<=n;i++) cin>>f[i][0];
for (int j=1;j<=lg[n];j++)
for (int i=1;i<=n-(1<<j)+1;i++){
f[i][j]=max(f[i][j-1],f[i+(1<<(j-1))][j-1]);
}
int t;
cin>>t;
while(t--)
{
cin>>x; int l=lg[m];
cout<<max(f[x][l],f[x+m-1-(1<<l)+1][l])<<endl;
}
}