BestCoder Round #3

Task schedule http://acm.hdu.edu.cn/showproblem.php?pid=4907

 #include<cstdio>
 #include<cstring>
 #define mt(a,b) memset(a,b,sizeof(a))
 const int M=;
 int a[M];
 bool vis[M];
 int main(){
     int t,n,m;
     while(~scanf("%d",&t)){
         while(t--){
             scanf("%d%d",&n,&m);
             mt(vis,);
             for(int i=;i<=n;i++){
                 scanf("%d",&a[i]);
                 vis[a[i]]=true;
             }
             int x=;
             for(int i=;i<=;i++){
                 if(!vis[i]){
                     for(int j=x;j<=i;j++){
                         a[j]=i;
                     }
                     x=i+;
                 }
             }
             while(m--){
                 scanf("%d",&x);
                 printf("%d\n",a[x]);
             }
         }
     }
     return ;
 }

end