#include <bits/stdc++.h>
#define int long long

using namespace std;

constexpr int inf = 1E18;

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

    int minn = inf; 
    vector <int> x (n), y (n);
    for (int i = 0; i < n; i ++) {
        cin >> x[i] >> y[i];
        minn = min (minn, x[i] * x[i] + y[i] * y[i]);
    }
    vector <int> p;
    
    const int N = 2 * r >= R ? 2 * r - R : R - 2 * r;

    if (minn <= N * N) {
        for (int i = 0; i < n; i ++) {
            if (x[i] * x[i] + y[i] * y[i] <= N * N) {
                p.push_back (i);
            }
        }
    } else {
        for (int i = 0; i < n; i ++) {
            if (x[i] * x[i] + y[i] * y[i] == minn) {
                p.push_back (i);
            }
        }
    }

    cout << p.size () << '\n';
    for (auto x : p) {
        cout << x + 1 << " \n"[x == p.back ()];
    }
}

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

    int T = 1;
    cin >> T;

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

    return 0;
}