#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cout << #x << ": " << x << el
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

int sq(int x) { return x * x; }

int len(pii &a) {
    return sq(a.x) + sq(a.y);
}

void solve() {
    int n, R, r; cin >> n >> R >> r;
    vector<pii> q(n);
    vector<int> ans;
    for (int i = 0; i < n; ++i) cin >> q[i].x >> q[i].y;
    int mi = INF;
    if (R - r - r < 0) {
        for (int i = 0; i < n; ++i) {
            if (len(q[i]) <= sq(r + r - R)) ans.emplace_back(i);
            mi = min(mi, len(q[i]));
        }
        if (ans.empty()) {
            for (int i = 0; i < n; ++i) 
                if (len(q[i]) == mi) ans.emplace_back(i);
        }
        cout << ans.size() << el;
        for (int i = 0; i < ans.size(); ++i) 
            cout << ans[i] + 1 << " \n"[i + 1 == ans.size()];
        return;
    }
    for (int i = 0; i < n; ++i) {
        if (len(q[i]) <= sq(R - r - r)) ans.emplace_back(i);
        mi = min(mi, len(q[i]));
    }
    if (ans.empty()) {
        for (int i = 0; i < n; ++i) 
            if (len(q[i]) == mi) ans.emplace_back(i);
    }
    cout << ans.size() << el;
    for (int i = 0; i < ans.size(); ++i) {
        cout << ans[i] + 1 << " \n"[i + 1 == ans.size()];
    }
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int tcase = 1;
    cin >> tcase;
    while (tcase--) solve();
}