#include <bits/stdc++.h>
#define ll long long
#define PII pair<int,int>
#define endl '\n'
#define int long long
#define  lc p<<1
#define  rc p<<1|1
using namespace  std;
const int N = 2e5 + 10;
int cnt = 0;
string s;
int a[N],b[N];
int f1[N],f2[N];
vector<PII>q;
vector<int>ans;
void solve() {
	
	int n,R,r;
	cin>>n>>R>>r;
	q.clear();
	ans.clear();
	for(int i=1;i<=n;i++){
		int x,y;
		cin>>x>>y;
		q.push_back({x*x+y*y,i});
	}
	sort(q.begin(),q.end());
	if(R>=2*r&&q.front().first<=(R-2*r)*(R-2*r)){
		for(int i=0;i<n;i++){
			if(q[i].first<=(R-2*r)*(R-2*r)){
				ans.push_back(q[i].second);
			}else{
				break;
			}
		}
	}else if(q.front().first<=(2*r-R)*(2*r-R)){
		for(int i=0;i<n;i++){
			if(q[i].first<=(2*r-R)*(2*r-R)){
				ans.push_back(q[i].second);
			}else{
				break;
			}
		}
	}else{
		int p=q.front().first;
		for(int i=0;i<n;i++){
			if(q[i].first==p){
				ans.push_back(q[i].second);
			}else{
				break;
			}
		}
	}
	cout<<ans.size()<<endl;
	sort(ans.begin(),ans.end());
	for(int i=0;i<ans.size();i++){
		cout<<ans[i]<<" \n"[i==ans.size()-1];
	}
}
signed main() {
	 ios::sync_with_stdio(false),cin.tie(0);
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
}