#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)

using namespace std;

int n, R, r;
vector<pair<int, int>> a;

bool read(){
	if (!(cin >> n >> R >> r))
		return false;
	a.resize(n);
	forn(i, n) cin >> a[i].first >> a[i].second;
	return true;
}

void solve(){
	vector<int> res;
	int mn = 1e9;
	int i = 0;
	for (auto& [x, y] : a){
		int d = x * x + y * y;
		if (d <= (R - 2 * r) * (R - 2 * r))
			res.push_back(i);
		++i;
		mn = min(mn, d);
	}
	if (res.empty()){
		int i = 0;
		for (auto& [x, y] : a){
			int d = x * x + y * y;
			if (d == mn)
				res.push_back(i);
			++i;
		}
	}
	cout << res.size() << '\n';
	forn(i, res.size()){
		if (i) cout << ' ';
		cout << res[i] + 1;
	}
	cout << '\n';
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int t;
	cin >> t;
	while (t--){
		read();
		solve();
	}
}