#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define pii pair<int,int>

using ll = long long;
using lf = long double;

const lf EPS = 1e-8L;
const lf PI = acos(-1);

lf area(lf r1, lf r2, lf d) {
    if (d >= r1 + r2) return 0.0L;

    if (d <= fabsl(r2 - r1)) return PI * (r1 < r2 ? r1*r1 : r2*r2);

    lf alpha= acos((r1*r1 - r2*r2 + d*d) / (2.0L * d * r1));
    lf betha = acos((r2*r2 - r1*r1 + d*d) / (2.0L * d * r2));

    lf a1 = r1*r1 * (alpha  - sinl(alpha) * cosl(alpha));
    lf a2 = r2*r2 * (betha  - sinl(betha) * cosl(betha));

    return a1 + a2;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int tt; cin >> tt;
    while (tt--) {
        int n, R, r; cin >> n >> R >> r;

        vector<pair<int, int>> a(n);
        vector<lf> p(n);
        for (int i = 0; i<n; ++i) {
            cin >> a[i].first >> a[i].second;
            p[i] = area(R - r, r, sqrt(a[i].ff*a[i].ff + a[i].ss*a[i].ss));
        }
        lf best = *max_element(p.begin(), p.end());
        vector<int> ans;
        for (int i=0; i<n; ++i) {
            if (p[i] == best) ans.push_back(i);
        }

        cout << ans.size() << endl;
        for(int i = 0; i < (int)ans.size(); ++i) {
            if (i>0) cout<< ' ';
            cout << ans[i] + 1;
        } 
        cout << '\n';
    }
    return 0;
}