#include<iostream>

 #include<algorithm>

 using namespace std;

 #define Max 1000010

 int n,m;

 int pre[Max];

 struct Food{

     int d;

     int c;

 };

 Food food[Max];

 bool cmp(Food a,Food b){

     return a.d<b.d;

 }

 int find(int l,int r,int x){

     int ans;

     while(l <= r){

         int mid = (l + r) / ;

         if(food[x].d <= x)

             l=mid+,ans = mid;

         else

             r = mid - ;

     }

     return ans;

 }

 int main(){

     int T;

     scanf("%d",&T);

     while(T--){

         scanf("%d%d",&n,&m);

         for(int i =  ;i <= n ;i++){

             scanf("%d%d",&food[i].d,&food[i].c);

         }

         sort(food+,food+n+,cmp);

         pre[]=;

         for(int i = ; i <= n; i++)

             pre[i]=max(pre[i-],food[i].c);

         int t;

         while(m--){

             scanf("%d",&t);

             int ans = find(,n,t);

             printf("%d\n",pre[ans]);

         }

     }

     return ;

 }