#include <bits/stdc++.h>

using namespace std;

const int N = 5050;
int n, R, r;
int x[N], y[N];

void solve() {
    scanf("%d%d%d", &n, &R, &r);
    for (int i = 1; i <= n; ++i) {
        scanf("%d%d", &x[i], &y[i]);
    }
    int flag = 0;
    int minn = 1e9;
    for (int i = 1; i <= n; ++i) {
        if (x[i] * x[i] + y[i] * y[i] <= (R - r) * (R - r)) {
            flag = 1;
        }
        minn = min(minn, x[i] * x[i] + y[i] * y[i]);
    }
    vector<int> ans;
    // cerr << flag << '\n';s
    if (flag == 1) {
        for (int i = 1; i <= n; ++i) {
            // cerr << x[i] * x[i] << ' ' << y[i] * y[i] << '\n';
            if (x[i] * x[i] + y[i] * y[i] <= (R - r) * (R - r)) {
                ans.emplace_back(i);
            }
        }
    }
    else {
        for (int i = 1; i <= n; ++i) {
            if (x[i] * x[i] + y[i] * y[i] == minn) {
                ans.emplace_back(i);
            }
        }
    }
    printf("%lu\n", ans.size());
    for (auto it : ans) {
        printf("%d ", it);
    }
    printf("\n");
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        solve();
    }
    return 0;
}