#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
#define pldld pair<ld, ld>
#define x first
#define y second
const ld eps = 1e-20;
ld dist(pldld a, pldld b) {
	return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y)); 
}
void solve() {
	ld n, R, r; cin >> n >> R >> r;
	vector<pldld> b(n); vector<ld> d(n);
	ld mn = 2e4 + 10;
	for (int i = 0; i < n; i++) {
		cin >> b[i].x >> b[i].y;
		d[i] = dist(b[i], {0, 0});
		mn = min(mn, d[i]);
	}
	vector<int> ans;
	for (int i = 0; i < n; i++) {
		if (fabs(d[i] - mn) <= eps) ans.push_back(i);
	}
	if (mn < R - 2 * r || fabs(mn - R + 2 * r) <= eps) {
		ans.clear();
		for (int i = 0; i < n; i++) if (d[i] < R - 2 * r || fabs(d[i] - R + 2 * r) <= eps) ans.push_back(i);
	}
	cout << ans.size() << '\n';
	for (int i : ans) {
		cout << i + 1; if (i != *(ans.rbegin())) cout << ' ';
	} cout << '\n';
}
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int T; cin >> T;
	while (T--) solve();
	return 0;
}