#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

const int INF = 1e9;

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

    if (r == R) {
        cout << n << "\n";
        for (int i = 0; i < n; i++) cout << i + 1 << (i + 1 == n ? "\n" : " ");
        return;
    }
    auto calc = [&](int d2) -> int {
        assert(d2 <= R * R);
        int dr = abs(R - 2 * r);
        if (d2 <= dr * dr) return INF;
        return INF - d2;
    };

    int maxi = calc(ds[0]);
    for (int i = 1; i < n; i++) chmax(maxi, calc(ds[i]));
    vector<int> ans;
    for (int i = 0; i < n; i++) {
        if (calc(ds[i]) == maxi) {
            ans.emplace_back(i + 1);
        }
    }

    cout << ans.size() << "\n";
    cout << ans << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}