#include <bits/stdc++.h>

using i64 = long long;

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

    int a = std::abs(R - 2 * r);

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

    int mind = *std::min_element(d.begin(), d.end());
    std::vector<int> ans;
    for (int i = 0; i < n; i++) {
        if (d[i] == mind) {
            ans.push_back(i);
        }
    }
    std::cout << ans.size() << "\n";
    for (int i = 0; i < ans.size(); i++) {
        std::cout << ans[i] + 1 << " \n"[i == ans.size() - 1];
    }
}

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

    int t;
    std::cin >> t;

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

    return 0;
}