#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;

#define all(a) begin(a), end(a)
#define len(a) int((a).size())

void solve(int /* test_num */) {
    int n, R, r;
    cin >> n >> R >> r;
    vector<ll> x(n), y(n), length2(n);
    for (int i = 0; i < n; i++) {
        cin >> x[i] >> y[i];
        length2[i] = x[i] * x[i] + y[i] * y[i];
    }

    auto output = [&](vector<int> v) {
        assert(!v.empty());
        cout << len(v) << '\n';
        for (int i = 0; i < len(v); i++) {
            cout << v[i] + 1 << " \n"[i + 1 == len(v)];
        }
    };

    {
        vector<int> close;
        for (int i = 0; i < n; i++) {
            // sqrt(length2[i]) + r <= R - r
            if (1ll * (R - 2 * r) * (R - 2 * r) >= length2[i]) {
                close.push_back(i);
            }
        }

        if (!close.empty()) {
            output(close);
            return;
        }
    }

    auto mn = *min_element(all(length2));
    vector<int> ans;
    for (int i = 0; i < n; i++) {
        if (length2[i] == mn) {
            ans.push_back(i);
        }
    }
    output(ans);
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int tests;
    cin >> tests;
    for (int test_num = 1; test_num <= tests; test_num++) {
        solve(test_num);
    }
}