#include <bits/stdc++.h>

using namespace std;


using i64 = long long;

const i64 inf = LLONG_MAX / 2;

void solve() {
	int n, R, r;
	cin >> n >> R >> r;

	i64 val = inf, d = (2ll * r - R) * (2ll * r - R);
	vector<int> ret, res;


	for(int i = 1; i <= n; i ++) {
		i64 x, y, dis;
		cin >> x >> y;
		dis = x * x + y * y;
		
		if(dis < val) {
			val = dis, ret = vector<int>(1, i);
		} else if(dis == val) {
			ret.push_back(i);
		}

		if(dis <= d) {
			res.push_back(i);
		}

	}
	
	if(not res.empty()) {
		cout << res.size() << "\n";
		for(auto i : res)
			cout << i << " \n"[i == res.back()];
		return;
	}

	cout << ret.size() << "\n";
	for(auto i : ret)
		cout << i << " \n"[i == ret.back()];
	return;
}


int main() {
	int T;
	cin >> T;

	while(T --) 
		solve();

	return 0;
}