#include<bits/stdc++.h>
#define F(i, a, b) for(int i = a; i <= b; i ++)
#define pii pair<int, int> 
#define fi first
#define int long long
#define se second

using namespace std;
const int N = 105;
int n, R, r;
pii a[N];
void sol() {
    cin >> n >> R >> r;
    int tmp = (R - 2 * r) * (R - 2 * r);
    int ok = 0, mn = 1e18;
    F(i, 1, n) {
        cin >> a[i].fi >> a[i].se;
        int now = a[i].fi * a[i].fi + a[i].se * a[i].se;
        mn = min(mn, now);
        if(now <= tmp) ok = 1;
    }
    vector<int> res;
    F(i, 1, n) {
        int now = a[i].fi * a[i].fi + a[i].se * a[i].se;
        if(mn == now) res.push_back(i);
        else if(ok && now <= tmp) res.push_back(i);
    }
    cout << res.size() << "\n";
    for(auto x : res) cout << x << " "; cout << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t; cin >> t;
    F(i, 1, t) sol();
    return 0;
}