#include<bits/stdc++.h>
#define LL long long
#define LD long double
#define fr(x) freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);
using namespace std;
const int N=1e5+5;const LD pi=acosl(-1);
int T,n,R,r;LD ans[N];
struct comp
{
	int x,y;
}a[N],O;
inline int p2(int x){return x*x;}
inline int dis(comp A,comp B){return p2(A.x-B.x)+p2(A.y-B.y);}
inline LD calc(comp A,comp B,int r,int R)
{
	if(r>R) swap(r,R),swap(A,B);
	LD d=sqrtl(dis(A,B));
	if(d>=R+r) return 0;
	if(d<=R-r) return pi*r*r;
	LD ang1=acosl((r*r+d*d-R*R)/(2*r*d));
	LD ang2=acosl((R*R+d*d-r*r)/(2*R*d));
	return ang1*r*r + ang2*R*R - r*d*sinl(ang1);
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin>>T;
	while(T--)
	{
		cin>>n>>R>>r;O={0,0};R-=r;LD mx=0;
		for(int i=1;i<=n;i++) cin>>a[i].x>>a[i].y;
		for(int i=1;i<=n;i++) ans[i]=calc(a[i],O,r,R),mx=max(mx,ans[i]);
		basic_string<int>g;
		for(int i=1;i<=n;i++) if(ans[i]==mx) g+=i;
		cout<<g.size()<<"\n";for(int i:g) cout<<i<<" ";cout<<"\n";
	}
	return 0;
}