#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

struct node {
	ll x, y;
} d[100100];

ll T, n, R, r, mn, t;
ll ans[100100];
ld s;

int main() {
	scanf("%lld", &T);
	while (T--) {
		mn = 1e18;
		scanf("%lld%lld%lld", &n, &R, &r);
		for (ll i = 1; i <= n; i++) {
			scanf("%lld%lld", &d[i].x, &d[i].y);
			mn = min(mn, d[i].x * d[i].x + d[i].y * d[i].y);
		}
		s = mn;
		s = sqrt(s);
		t = 0;
		if (s + 2 * r <= R || s <= 2 * r - R) {
			for (ll i = 1; i <= n; i++) {
				s = d[i].x * d[i].x + d[i].y * d[i].y;
				s = sqrt(s);
				if ((s + 2 * r) <= R || s <= 2 * r - R) {
					ans[++t] = i;
				}
			}
		} else {
			for (ll i = 1; i <= n; i++) {
				if (d[i].x * d[i].x + d[i].y * d[i].y == mn) {
					ans[++t] = i;
				}
			}
		}
		printf("%lld\n", t);
		printf("%lld", ans[1]);
		for (ll i = 2; i <= t; i++) {
			printf(" %lld", ans[i]);
		}
		printf("\n");
	}
	return 0;
}