#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
long long v[N],a[N],p[N],d[N];
int l[N],r[N];
int op[N],k[N];
int f[N];
void Init(){
	for(int i=1;i<=100000;i++){
		op[i]=0;
		k[i]=0;
		f[i]=i;
	}
	return;
}
int n,m,L;
long long V;
bool ef1(int now,int id){
	int el=id,er=m,best=-1;
	while(el<=er){
		int mid=(el+er)/2;
		long long s=p[mid]-d[now];
		if(sqrt(1.0*(v[now]*v[now]+2*a[now]*s))<=1.0*V){
			el=mid+1;
		}
		else{
			er=mid-1;
			best=mid;
		}
	}
	if(best!=-1){
		l[now]=best;
		return true;
	}
	return false;
}
bool ef2(int now,int id){
	int el=id,er=m,best=-1;
	while(el<=er){
		int mid=(el+er)/2;
		long long s=p[mid]-d[now];
		if((v[now]*v[now]+2*a[now]*s)<0){
			er=mid-1;
		}
		else if(sqrt(1.0*(v[now]*v[now]+2*a[now]*s))<=1.0*V){
			er=mid-1;
		}
		else{
			el=mid+1;
			best=mid;
		}
	}
	if(best!=-1){
		l[now]=id;
		r[now]=best;
		return true;
	}
	return false;
}
bool ef3(int now,int id){
	if(v[now]>V){
		l[now]=id;
		r[now]=m;
		return true;
	}
	return false;
}
bool cmp(int x,int y){
	//cout<<x<<" "<<y<<endl;
	if(l[x]!=l[y]){
		return l[x]<l[y];
	}
	return r[x]>r[y];
}
int main(){
	//freopen("detect5.in","r",stdin);
	int t;
	scanf("%d",&t);
	while(t--){
		Init();
		scanf("%d%d%d%lld",&n,&m,&L,&V);
		for(int i=1;i<=n;i++){
			scanf("%lld%lld%lld",&d[i],&v[i],&a[i]);
		}
		for(int i=1;i<=m;i++){
			scanf("%lld",&p[i]);
		}
		int ans=0;
		for(int i=1;i<=n;i++){
			l[i]=1;
			r[i]=m;
			int id=lower_bound(p+1,p+m+1,d[i])-p;
			if(id>m){
				continue;
			}
			if(a[i]>0){
			    ans+=ef1(i,id);
		    }
		    else if(a[i]<0){
		    	ans+=ef2(i,id);
			}
			else{
				ans+=ef3(i,id);
			}
		}
		printf("%d ",ans);
		sort(f+1,f+n+1,cmp);
		int mnr=1e9;
		for(int i=n;i>=1;i--){
			if(mnr<=r[f[i]]){
				//cout<<f[i]<<endl;
				op[f[i]]=1;
			}
			mnr=min(r[f[i]],mnr);
		}
		int ans2=0;
		int lar=0;
		for(int i=1;i<=n;i++){
			//cout<<l[f[i]]<<" "<<r[f[i]]<<endl;
			if(op[f[i]]){
				continue;
			}
			if(lar<l[f[i]]){
				lar=r[f[i]];
				ans2++;
			}
		}
		printf("%d\n",m-ans2); 
	}
	return 0;
}