#include <bits/stdc++.h>

using namespace std;


using i64 = long long;

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

	vector<i64> dis(n + 1);

	for(int i = 1; i <= n; i ++) {
		i64 x, y;
		cin >> x >> y;
		dis[i] = x * x + y * y;
	}

	if(2 * r > R) {
		i64 d = (2ll * r - R) * (2ll * r - R);
		vector<int> res;

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

	vector<int> res(1, 1);
	for(int i = 2; i <= n; i ++) {
		if(dis[i] < dis[res[0]]) {
			res = vector<int>(1, i);
		} else if(dis[i] == dis[res[0]]){
			res.push_back(i);
		}
	}
	cout << res.size() << "\n";
	for(auto i : res)
		cout << i << " \n"[i == res.back()];
	return;
}


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

	while(T --) 
		solve();

	return 0;
}