#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);
    r = 2 * r;
    for (int i = 1; i <= n; ++i) {
        scanf("%d%d", &x[i], &y[i]);
    }
    int minn = 1e9;
    for (int i = 1; i <= n; ++i) {
        minn = min(minn, x[i] * x[i] + y[i] * y[i]);
    }
    vector<int> ans;
    if (minn <= (R - r) * (R - r)) {
        for (int i = 1; i <= n; ++i) {
            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 (int i = 0; i + 1 < ans.size(); ++i) {
        printf("%d ", ans[i]);
    }
    printf("%d\n", ans[ans.size() - 1]);
}

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