#include <bits/stdc++.h>

constexpr int INF = 1e9;

void solve() {
    int n, R, r;
    std::cin >> n >> R >> r;

    std::vector<int> x(n), y(n);
    for (int i = 0; i < n; ++i) {
        std::cin >> x[i] >> y[i];
    }

    std::vector<int> ans;
    int min_d = INF;

    for (int i = 0; i < n; ++i) {
        int d = x[i] * x[i] + y[i] * y[i];
        if (d <= (R - r * 2) * (R - r * 2)) {
            ans.push_back(i);
        }
        min_d = std::min(min_d, d);
    }

    if (ans.empty()) {
        for (int i = 0; i < n; ++i) {
            int d = x[i] * x[i] + y[i] * y[i];
            if (d == min_d) {
                ans.push_back(i);
            }
        }
    }
    
    std::cout << ans.size() << '\n';
    for (int i : ans) {
        std::cout << i + 1 << ' ';
    }
    std::cout << '\n';
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }
}