#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

struct Pt
{
	int x, y;
	Pt operator-(const Pt& p) const
	{
		return {x - p.x, y - p.y};
	}
	bool operator<(const Pt& p) const
	{
		return x == p.x ? y < p.y : x < p.x;
	}
};

LL sq(const Pt& p)
{
	return (LL)p.x * p.x + (LL)p.y * p.y;
}

int sgn(LL x)
{
	return (0 < x) - (x < 0);
}

LL dot(const Pt& p, const Pt& q)
{
	return (LL)p.x * q.x + (LL)p.y * q.y;
}

LL cross(const Pt& p, const Pt& q)
{
	return (LL)p.x * q.y - (LL)p.y * q.x;
}

LL orient(const Pt& p, const Pt& q, const Pt& r)
{
	return cross(q - p, r - p);
}

bool inDisk(const Pt& a, const Pt& b, const Pt& p)
{
	return sgn(dot(a - p, b - p)) <= 0;
}

bool onSegment(const Pt& a, const Pt& b, const Pt& p)
{
	return sgn(orient(a, b, p)) == 0
		&& inDisk(a, b, p);
}

bool properInter(const Pt& a, const Pt& b, const Pt& c, const Pt& d)
{
	LL oa = orient(c, d, a);
	LL ob = orient(c, d, b);
	LL oc = orient(a, b, c);
	LL od = orient(a, b, d);
	return sgn(oa) * sgn(ob) == -1
		&& sgn(oc) * sgn(od) == -1;
}

/*bool inter(const Pt& a, const Pt& b, const Pt& c, const Pt& d)
{
	LL oa = orient(c, d, a);
	LL ob = orient(c, d, b);
	LL oc = orient(a, b, c);
	LL od = orient(a, b, d);
	if (sgn(oa) * sgn(ob) > 0)
		return false;
	if (sgn(oc) * sgn(od) > 0)
		return false;
	int minxab = min(a.x, b.x);
	int maxxab = max(a.x, b.x);
	int minyab = min(a.y, b.y);
	int maxyab = max(a.y, b.y);
	int minxcd = min(c.x, d.x);
	int maxxcd = max(c.x, d.x);
	int minycd = min(c.y, d.y);
	int maxycd = max(c.y, d.y);
	return minxcd <= maxxab && minxab <= maxxcd
		&& minycd <= maxyab && minyab <= maxycd;
}*/

void solve()
{
	int s, r, w, n;
	cin >> s >> r >> w >> n;
	set<Pt> sensors;
	FOR(i, 0, s)
	{
		Pt p;
		cin >> p.x >> p.y;
		sensors.insert(p);
	}
	vector<pair<Pt, Pt>> walls(w);
	for (auto& [p1, p2] : walls)
		cin >> p1.x >> p1.y >> p2.x >> p2.y;
	FOR(i, 0, n)
	{
		Pt p;
		cin >> p.x >> p.y;
		vector<Pt> ans;
		FOR(dx, -r, r + 1)
		{
			FOR(dy, -r, r + 1)
			{
				Pt sensor = {p.x + dx, p.y + dy};
				if (sensors.count(sensor))
				{
					int cntWalls = 0;
					for (auto [p1, p2] : walls)
					{
						if (properInter(sensor, p, p1, p2) || onSegment(sensor, p, p1) || onSegment(sensor, p, p2))
							cntWalls++;
					}
					if (r - cntWalls >= 0 && sq(sensor - p) <= (r - cntWalls) * (r - cntWalls))
					{
						ans.PB(sensor);
					}
				}
			}
		}
		cout << SZ(ans);
		for (Pt sensor : ans)
		{
			cout << " (" << sensor.x << "," << sensor.y << ")";
		}
		cout << "\n";
	}
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t;
	cin >> t;
	while (t--)
		solve();
	return 0;
}