民间数据AC 官方数据80pts

#include<bits/stdc++.h>
using namespace std;
//_________________________________________________________________________________________________________________________________________
const int N = 100009;
int n, m, L, V;
struct AC{
	int d, v, a;
	int l, r;//(l, r)
	void calc(){
		l = -1, r = -1;
		if(a == 0){
			if(v > V){
				l = d - 1;
				r = L + 1;
			}
		}
		else if(a > 0){
			if(v > V){
				l = d - 1;
				r = L + 1;
			}
			else{
				int k = (V * V - v * v) % (a * 2) == 0 ? -1 : 0;
				l = (V * V - v * v) / (a * 2) + d + k;
				r = L + 1;
			}
		}
		else{
			if(v > V){
				int k = (V * V - v * v) % (a * 2) == 0 ? 0 : 1;
				l = d - 1;
				r = (V * V - v * v) / (a * 2) + d + k;
			}
		}
		if(l < 0) l = -1;
		if(r > L) r = L + 1;
		if(l >= r) l = -1, r = -1;
	}
};
struct line{
	int l, r;//[l, r]
};
AC c[N];
line l[N];
int p[N];

bool cmp1(AC a, AC b){
	return a.l < b.l;
}

bool cmp2(line a, line b){
	return a.r < b.r;
}

void doit(){
	memset(p, 0, sizeof(p));
	scanf("%d%d%d%d", &n, &m, &L, &V);
	for(int i = 1; i <= n; i++){
		scanf("%d%d%d", &c[i].d, &c[i].v, &c[i].a);
		c[i].calc();
	}
	for(int i = 1; i <= m; i++) scanf("%d", &p[i]);
	
//	sort(c + 1, c + n + 1, cmp1);
	int  rp = 0;
	for(int i = 1; i <= n; i++){
		int ll = upper_bound(p + 1, p + m + 1, c[i].l) - p;
		int rr = lower_bound(p + 1, p + m + 1, c[i].r) - p - 1;
		if(p[ll] < c[i].r && ll <= m) l[++rp] = {ll, rr};
	}
	
	sort(l + 1, l + rp + 1, cmp2);
	int cnt = 0, ed = -0x3f3f3f3f;
	for(int i = 1; i <= rp; i++){
		if(l[i].l > ed){
			cnt++;
			ed = l[i].r;
		}
	}
	
	printf("%d %d\n", rp, m - cnt);
}

int main() {
//	freopen("detect.in","r",stdin);
//	freopen("detect.out","w",stdout);
	int T;
	scanf("%d", &T);
	while(T--){
		doit();
	}

	return 0;
}