#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define srep(i, s, t) for(int i = (s); i < (t); i++)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
template < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }
template < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }
using i64 = long long;
using f64 = long double;
i64 floor_div(const i64 n, const i64 d) { assert(d != 0); return n / d - static_cast<i64>((n ^ d) <  0 && n % d != 0); }
i64  ceil_div(const i64 n, const i64 d) { assert(d != 0); return n / d + static_cast<i64>((n ^ d) >= 0 && n % d != 0); }

void out(vector<int> I) {
    const int m = I.size();
    cout << m << "\n";
    rep(i, m) cout << I[i] + 1 << " \n"[i == m - 1];
    return;
}

void solve() {
    int n, R, r; cin >> n >> R >> r; R -= r;
    vector<int> x(n), y(n);
    rep(i, n) cin >> x[i] >> y[i];

    vector<int> d(n);
    rep(i, n) d[i] = x[i] * x[i] + y[i] * y[i];

    if(r <= R) {
        vector<int> ALL_IN;
        rep(i, n) if(d[i] <= (R - r) * (R - r)) ALL_IN.push_back(i);
        if(not ALL_IN.empty()) { out(ALL_IN); return; }
    } else {
        vector<int> ALL_CONTAIN;
        rep(i, n) if(d[i] <= (r - R) * (r - R)) ALL_CONTAIN.push_back(i);
        if(not ALL_CONTAIN.empty()) { out(ALL_CONTAIN); return; }
    }

    const int d_min = *min_element(d.begin(), d.end());

    if((R + r) * (R + r) <= d_min) {
        vector<int> I(n);
        rep(i, n) I[i] = i;
        out(I);
        return;
    } else {
        vector<int> argmin;
        rep(i, n) if(d[i] == d_min) argmin.push_back(i);
        out(argmin);
        return;
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    
    int T; cin >> T;
    rep(_, T) solve();
}