#include<bits/stdc++.h>
#define int long long 
using namespace std;
namespace IO{
    char buff[1<<21],*p1=buff,*p2=buff;
    char getch(){
        return p1==p2&&(p2=((p1=buff)+fread(buff,1,1<<21,stdin)),p1==p2)?EOF:*p1++;
    }
    template<typename T>
    void read(T &x){
        char ch=getch();int fl=1;x=0;
        while(ch>'9'||ch<'0'){if(ch=='-')fl=-1;ch=getch();}
        while(ch<='9'&&ch>='0'){x=x*10+ch-48;ch=getch();}
        x*=fl;
    }
    template<typename T,typename ...Args>
    void read(T &x,Args& ...args){
        read(x);read(args...);
    }
    char obuf[1<<21],*p3=obuf;
    void putch(char ch){
        if(p3-obuf<(1<<21))*p3++=ch;
        else fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=ch;
    }
    char ch[100];
    template<typename T>
    void write(T x){
        if(!x)return putch('0');
        if(x<0)putch('-'),x*=-1;
        int top=0;
        while(x)ch[++top]=x%10+48,x/=10;
        while(top)putch(ch[top]),top--;
    }
    template<typename T,typename ...Args>
    void write(T x,Args ...args){
        write(x),putch(' '),write(args...);
    }
    void flush(){fwrite(obuf,p3-obuf,1,stdout);}
}
using namespace IO;
const int N=2e5+5;
int n,R,r;
int dis[N],id[N];
void sol(){
	read(n,R,r);
	for(int i=1;i<=n;i++){
		int x,y;
		read(x,y);
		dis[i]=x*x+y*y;
		id[i]=i;
	}
	sort(id+1,id+n+1,[](int A,int B){return dis[A]==dis[B]?A<B:dis[A]<dis[B];});
	int pos=0;
	if(dis[id[1]]<=(R-2*r)*(R-2*r)){
		for(int i=1;i<=n;i++)
			if(dis[id[i]]<=(R-2*r)*(R-2*r))
				pos=i;
		sort(id+1,id+pos+1);
	}else{
		for(int i=1;i<=n;i++)
			if(dis[id[i]]==dis[id[1]])
				pos=i;
	}
	write(pos),putch('\n');
	for(int i=1;i<pos;i++)
		write(id[i]),putch(' ');
	write(id[pos]),putch('\n');
}
signed main(){
	int T;
	read(T);
	while(T--)sol();
	flush();
	return 0;
}