#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
	int T;cin>>T;
	while(T--){
		ll r,R,N; cin >> N >> R >> r;
		vector<ll> X(N), Y(N);
		for(int i = 0; i  < N; i++){
			cin >> X[i] >> Y[i];
		}
		vector<ll> ans;
		if(2*r-R >= 0){
			for(int i = 0; i < N; i++){
				if((X[i]*X[i]+Y[i]*Y[i]) <= (2*r-R)*(2*r-R))ans.push_back(i+1);
			}
		}
		if(ans.size() > 0){
			cout << ans.size() << endl;
			for(int i = 0; i < ans.size(); i++)cout << ans[i] << ' ';
			cout << endl;
			continue;
		}
		if(R-2*r >= 0){
			for(int i = 0; i < N; i++){
				if((X[i]*X[i])+(Y[i]*Y[i]) <= (R-2*r)*(R-2*r))ans.push_back(i+1);
			}
		}
		if(ans.size() > 0){
			cout << ans.size() << endl;
			for(int i = 0; i < ans.size(); i++){
				cout << ans[i] << ' ';
			}
			cout << endl;
			continue;
		}
		ll mn = 1LL<<60;
		for(int i = 0; i < N; i++)mn = min(mn , (X[i]*X[i])+(Y[i]*Y[i]));
		for(int i = 0; i < N; i++)if(mn == (X[i]*X[i])+(Y[i]*Y[i]))ans.push_back(i+1);
		cout << ans.size() << endl;
		for(int i = 0; i < ans.size(); i++)cout << ans[i] << ' ';
		cout << endl;
	}
	return 0;
	


}