#include <cstdio>
#include <string>
#include <iostream>
#include <vector>
#include <algorithm>

#define PB push_back

using namespace std;

typedef pair < int, int > pii;

int main(){
	int T; scanf("%d", &T);
	for(;T--;) {
		int n, r, R; scanf("%d%d%d", &n, &R, &r);
		vector < pii > v;
		for(int i = 1;i <= n;i++) {
			int x, y; scanf("%d%d", &x, &y);
			v.PB({x * x + y * y, i});
		}
		sort(v.begin(), v.end());
		int ans = 0;
		int crit = abs(R - 2 * r);
		vector < int > ind;
		if(v[0].first <= crit * crit) {
			for(pii x : v) ans += x.first <= crit * crit;
			printf("%d\n", ans);
			for(pii x : v) if(x.first <= crit * crit) ind.PB(x.second);
		} else {
			for(pii x : v) ans += x.first == v[0].first;		
			printf("%d\n", ans);
			for(pii x : v) if(x.first == v[0].first) ind.PB(x.second);
		}
		sort(ind.begin(), ind.end());
		for(int t : ind) {
			printf("%d", t);
			if(t != ind.back()) printf(" ");
		}
		printf("\n");
	}
	return 0;
}