BestCoder Round #3 Task schedule

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<cctype>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<string>
#include<stack>
#include<set>
#define ll long long
#define MAX 200010
#define INF INT_MAX
#define eps 1e-8

using namespace std;

int a[MAX],b[MAX];

int main(){
	int T,n,q;
	scanf("%d",&T);
	while (T--){
		memset(a,0,sizeof(a));
		scanf("%d%d",&n,&q);
		int t,maxn = 0;
		for (int i=0; i<n; i++){
			scanf("%d",&t);
			a[t] = 1;
			maxn = max(maxn,t);
		}
		for (int i=1; i<= maxn; i++) b[i] = i;
		int i = 1;
		while (i <= maxn){
			int j = i;
			while (a[j]) j++;
			b[i] = j;
			i = j + 1;
		}
		i = 1;
		while(i <= maxn){
			if (b[i] == i) i++;
			else{
				for (int j=i; j<=b[i]; j++) b[j] = b[i];
				i = b[i] + 1;
			}
		}
		//for (int i=1; i<=maxn; i++) printf("%d ",b[i]); printf("\n");
		while(q--){
			scanf("%d",&t);
			if (t > maxn) printf("%d\n",t);
			else printf("%d\n",b[t]);
		}
	}
	return 0;
}