#include <iostream>
#include <algorithm>
#include <string>
#include <assert.h>
using namespace std;
 
 
 
long long readInt(long long l,long long r,char endd){
	long long x=0;
	int cnt=0;
	int fi=-1;
	bool is_neg=false;
	while(true){
		char g=getchar();
		if(g=='-'){
			assert(fi==-1);
			is_neg=true;
			continue;
		}
		if('0'<=g && g<='9'){
			x*=10;
			x+=g-'0';
			if(cnt==0){
				fi=g-'0';
			}
			cnt++;
			assert(fi!=0 || cnt==1);
			assert(fi!=0 || is_neg==false);
			
			assert(!(cnt>19 || ( cnt==19 && fi>1) ));
		} else if(g==endd){
			assert(cnt>0);
			if(is_neg){
				x= -x;
			}
			if(!(l<=x && x<=r)){
				cerr<<l<<" "<<r<<" "<<x<<endl;
			}
			assert(l<=x && x<=r);
			return x;
		} else {
			assert(false);
		}
	}
}
string readString(int l,int r,char endd){
	string ret="";
	int cnt=0;
	while(true){
		char g=getchar();
		assert(g!=-1);
		if(g==endd){
			break;
		}
		cnt++;
		ret+=g;
	}
	assert(l<=cnt && cnt<=r);
	return ret;
}
long long readIntSp(long long l,long long r){
	return readInt(l,r,' ');
}
long long readIntLn(long long l,long long r){
	return readInt(l,r,'\n');
}
string readStringLn(int l,int r){
	return readString(l,r,'\n');
}
string readStringSp(int l,int r){
	return readString(l,r,' ');
}

int T;
int n,m;
int sm_n=0,sm_m=0;
pair<int,int> rng[100100];
pair<int,int> ppl[100100];
int sol[100100];
int main(){
	//freopen("01.txt","r",stdin);
	//freopen("01o.txt","w",stdout);
	T=readIntLn(1,100);
	while(T--){
		n=readIntSp(1,100000);
		m=readIntLn(1,100000);
		sm_n+=n;
		sm_m+=m;
		assert(sm_n<=300000);
		assert(sm_m<=300000);
		for(int i=0;i<n;i++){
			rng[i].first = readIntSp(1,999999999);
			rng[i].second = readIntLn(rng[i].first+1,999999999);
		}
		for(int i=0;i<m;i++){
			ppl[i].first = readIntLn(1,1000000000);
			ppl[i].second = i;
		}
		sort(rng,rng+n);
		sort(ppl,ppl+m);
		for(int i=1;i<n;i++){
			assert(rng[i-1].second < rng[i].first);
		}
		int cur =0;
		for(int i=0;i<m;i++){
			
			while(cur < n && rng[cur].second <= ppl[i].first){
				cur++;
			}
			if(cur==n){
				sol[ppl[i].second ]  =-1;
				continue;
			}
			if(ppl[i].first < rng[cur].first){
				sol[ppl[i].second] = rng[cur].first - ppl[i].first;
			} else {
				sol[ppl[i].second] = 0;
			}
		}
		for(int i=0;i<m;i++){
			cout<<sol[i]<<endl;
		}
	}
	assert(getchar()==-1);
}