#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e5+5,M=N*30+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,R,r,X[N],Y[N];
ll dis[N];
void Solve(){
	scanf("%d%d%d",&n,&R,&r);
	for(int i=1;i<=n;i++) scanf("%d%d",&X[i],&Y[i]),dis[i]=1ll*X[i]*X[i]+1ll*Y[i]*Y[i];
	ll mi=*min_element(dis+1,dis+n+1);
	vector<int> ans;
	if(R>=2*r&&mi<=1ll*(R-2*r)*(R-2*r)){
		for(int i=1;i<=n;i++) if(dis[i]<=1ll*(R-2*r)*(R-2*r)) ans.push_back(i);
	}else if(R<=2*r&&mi<=1ll*(2*r-R)*(2*r-R)){
		for(int i=1;i<=n;i++) if(dis[i]<=1ll*(2*r-R)*(2*r-R)) ans.push_back(i);
	}else{
		for(int i=1;i<=n;i++) if(dis[i]==mi) ans.push_back(i);
	}
	printf("%d\n",int(ans.size()));
	for(int i=1;i<=ans.size();i++) printf("%d%c",ans[i-1]," \n"[i==ans.size()]);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}