cf-div2.cpp

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
	ll x;
	cin>>x;
	while(x--){
		ll n,m,q;
		cin>>n>>m>>q;
		vector<ll>nums(m);
		for(int i=0;i<m;i++){
			cin>>nums[i];
		}
		vector<ll>queries(q);
		for(int i=0;i<q;i++){
			cin>>queries[i];
		}
		sort(nums.begin(),nums.end());
		for(int i=0;i<queries.size();i++){
			ll cell=queries[i];
		ll startingPositon;
		auto startIndex = lower_bound(nums.begin(),nums.end(),cell);
		if(startIndex == nums.begin()){
			startingPositon = -1;
		}
		else if (startIndex != nums.end() && *startIndex == cell) {
        	--startIndex;
        	--startIndex;
        	int pos = startIndex-nums.begin();
        	startingPositon=nums[pos];
    	}
    	else{
    		--startIndex;
    		int pos = startIndex-nums.begin();
        	startingPositon=nums[pos];
    	}

		ll lastIndex = upper_bound(nums.begin(),nums.end(),cell-1)-nums.begin();
		ll lastPositon;
		if(lastIndex == nums.size()){
			lastPositon = -1;
		}
		else{
			lastPositon = nums[lastIndex];
		}
		
		ll ans =0;
		if(startingPositon==-1){
			ans=max(ans*1ll,(lastPositon-1)*1ll);
		}
		else if(lastPositon==-1){
			ans=max(ans,n-startingPositon);
		}
		else{
			ll stay = min((lastPositon-cell)*1ll, (cell-startingPositon)*1ll);
			ll temp= stay-1;
			ll maxStay = max((lastPositon-cell)*1ll, (cell-startingPositon)*1ll);
			maxStay-=temp;
			ll move = temp+ (maxStay/2 + maxStay%2);
			ans=max(stay,move);
		}		
		cout<<ans<<endl;
		}
		
	}
	return 0;
}