#include<bits/stdc++.h>
using namespace std;
#define N 100005
int n,R,r;
struct Vec
{
	int x,y,id;
	int norm() {return x*x+y*y;}
};
Vec a[N];
void work()
{
	cin>>n>>R>>r;
	for(int i=1;i<=n;i++) cin>>a[i].x>>a[i].y,a[i].id=i;
	sort(a+1,a+n+1,[&](Vec x,Vec y) {return x.norm()<y.norm();});
	vector<int> ans;
	int cur=1;
	ans.push_back(a[1].id);
	while(cur+1<=n)
	{
		cur++;
		if(a[1].norm()==a[cur].norm()) ans.push_back(a[cur].id);
		else if((a[1].norm()<=(2*r-R)*(2*r-R))&&(a[cur].norm()<=(2*r-R)*(2*r-R))) ans.push_back(a[cur].id);
		else break;
	}
	cout<<ans.size()<<endl;
	sort(ans.begin(),ans.end());
	for(int i=0;i<(int)ans.size();i++) printf("%d%c",ans[i]," \n"[i==(int)ans.size()-1]);
}
signed main()
{
#ifdef xay5421
	freopen("b.in","r",stdin);
#endif
	int T; cin>>T;
	while(T--) work();
	return 0;
}