#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 110;

ll n, R, r;
struct node {
	ll x, y;
} a[maxn];

void solve() {
	scanf("%lld%lld%lld", &n, &R, &r);
	ll mn = 9e18;
	for (int i = 1; i <= n; ++i) {
		scanf("%lld%lld", &a[i].x, &a[i].y);
		mn = min(mn, a[i].x * a[i].x + a[i].y * a[i].y);
	}
	mn = max(mn, (R - r * 2) * (R - r * 2));
	vector<int> ans;
	for (int i = 1; i <= n; ++i) {
		if (a[i].x * a[i].x + a[i].y * a[i].y <= mn) {
			ans.pb(i);
		}
	}
	printf("%d\n", (int)ans.size());
	for (int i : ans) {
		printf("%d ", i);
	}
	putchar('\n');
}

int main() {
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}