#include<bits/stdc++.h>

using namespace std;

#define irep(i,l,r) for(int i = l; i <= r; ++ i)
typedef long long ll;
#define IOS ios::sync_with_stdio(false),cin.tie(0);

const int N = 200000 + 7;

void solve(){
	int n, R, r;
	cin >> n >> R >> r;
	ll d = max(R - 2 * r, 2 * r - R);
	vector<array<ll, 2>>a(n);
	irep(i, 0, n - 1){
		ll x, y;
		cin >> x >> y;
		ll dis = x * x + y * y;
		if(dis <= d * d)dis = -1;
		a[i] = {dis, i};
	}
	sort(a.begin(), a.end());
	while(a.back()[0] != a[0][0])a.pop_back();
	cout << a.size() << '\n';
	irep(i, 0, a.size() - 1){
		cout << a[i][1] + 1 << " \n"[i == a.size() - 1];
	}
}

int main(){
	IOS
	int T;
	cin >> T;
	while(T --){
		solve();
	}
}