#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

vector<long long> adj[100];

int cnt(long long x){
	int ret=0;
	while(x){
		ret++;
		x/=2;
	}
	return ret;
}

int n;
long long arr[1001001];

vector<long long> merge(vector<long long> & a,vector<long long> & b){
	vector<long long> ret;

	int sa=a.size();
	int sb=b.size();
	int cur_a=0;
	int cur_b=0;
	while(cur_a<sa && cur_b<sb){
		if(a[cur_a] < b[cur_b]){
			ret.push_back(a[cur_a]);
			cur_a++;
		} else {
			ret.push_back(b[cur_b]);
			cur_b++;
		}
	}
	while(cur_a<sa){
		ret.push_back(a[cur_a]);
		cur_a++;
	}
	while(cur_b<sb){
		ret.push_back(b[cur_b]);
		cur_b++;
	}
	a.clear();
	b.clear();
	return ret;
}

int query[1001001],cur_q=0;
int q;
long long ans[1001001];
int main(){
	//cin>>n>>q;
	scanf("%d %d",&n,&q);
	for(int i=0;i<n;i++){
		//cin>>arr[i];
		scanf("%lld",arr+i);
	}
	for(int i=0;i<q;i++){
		//cin>>query[i];
		scanf("%d",query+i);
	}
	sort(arr,arr+n);
	int mx=0;
	for(int i=0;i<n;i++){
		int h=cnt(arr[i]);
		mx=max(mx,h);
		adj[h].push_back(arr[i]);
	}
	int cur_time=1;
	query[q] = 1<<30;
	for(int i=mx;i>=1;i--){
		adj[i]=merge(adj[i],adj[i+1]);
		int s=adj[i].size();

		for(int j=s-1;j>=0;j--){
			if(query[cur_q] == cur_time){
				ans[cur_q] = adj[i][j];
				cur_q++;
			}
			cur_time++;
			adj[i][j]/=2;
		}

	}
	for(int i=0;i<q;i++){
		printf("%lld\n",ans[i]);
		//cout<<ans[i]<<endl;
	}
}