#include <bits/stdc++.h>
using namespace std;
double eps = 1e-8; const int N = 5050;
struct Point {
    double x, y, dis;
} a[5050];
int ans[5050];
int main() {
    int T, n;
    double R, r;
    scanf("%d", &T);
    while (T--) {
        scanf("%d%lf%lf", &n, &R, &r);
        double ansr;
        if (R >= 2 * r)
            ansr = R - 2 * r;
        else ansr = 2 * r - R;
        int j = 0, flag = 0;
        double mn = 9999999;
        for (int i = 0; i < n; i++) {
            scanf("%lf%lf", &a[i].x, &a[i].y);
            a[i].dis = sqrt(a[i].x * a[i].x + a[i].y * a[i].y);
            mn = min(mn, a[i].dis);
            if (a[i].dis <= ansr) {
                flag = 1; ans[j++] = i + 1;
            }
        }
        if (flag) {
            printf("%d\n%d", j, ans[0]);
            for (int i = 1; i < j; i++)
                printf(" %d", ans[i]);
                printf("\n");
        } else {
            double anss = 0;
            int j = 0;
            for (int i = 0; i < n; i++) {
                if (fabs(a[i].dis - mn) < eps)
                    ans[j++] = i + 1;
            }
            printf("%d\n%d", j, ans[0]);
            for (int i = 1; i < j; i++)
                printf(" %d", ans[i]);
                printf("\n");
        }
    }
    return 0;
}