#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using str = string;
using vl = vector<ll>;
#define reps(i, a, n) for (ll i = (a), i##_loop_size = (n); i < i##_loop_size; i++)
#define rep(i, n) reps(i, 0, n)
#define all(a) a.begin(), a.end()

bool chmin(ll& a, ll b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
bool chmax(ll& a, ll b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

void solve() {
    ll n, R, r;
    cin >> n >> R >> r;
    vector<array<ll, 2>> xy(n);
    rep(i, n) cin >> xy[i][0] >> xy[i][1];
    if (R == r) {
        cout << n << endl;
        rep(i, n) {
            cout << i + 1;
            if (i == n - 1) {
                cout << endl;
            } else {
                cout << ' ';
            }
        }
        return;
    }
    auto xy_copy = xy;
    sort(all(xy_copy), [](array<ll, 2> a, array<ll, 2> b) { return (a[0] * a[0] + a[1] * a[1]) < (b[0] * b[0] + b[1] * b[1]); });
    auto [x, y] = xy_copy.front();
    ll q = x * x + y * y;
    if (q <= (R - 2 * r) * (R - 2 * r)) {
        vector<ll> ans;
        rep(i, n) {
            auto [x, y] = xy[i];
            if (x * x + y * y <= (R - 2 * r) * (R - 2 * r)) {
                ans.push_back(i + 1);
            }
        }
        sort(all(ans));
        cout << ans.size() << endl;
        rep(i, ans.size()) {
            cout << ans[i];
            if (i + 1 == ans.size()) {
                cout << endl;
            } else {
                cout << ' ';
            }
        }
        return;
    }
    {
        vector<ll> ans;
        rep(i, n) {
            auto [x, y] = xy[i];
            if (x * x + y * y == q) {
                ans.push_back(i + 1);
            }
        }
        sort(all(ans));
        cout << ans.size() << endl;
        rep(i, ans.size()) {
            cout << ans[i];
            if (i + 1 == ans.size()) {
                cout << endl;
            } else {
                cout << ' ';
            }
        }
    }
}

int main() {
    ll t;
    cin >> t;
    rep(i, t) solve();
}