#include<bits/stdc++.h>

#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); i++)
#define rrep(i, n) for(ll i = ll(n)-1; i >= 0; i--)
#define rrep2(i, n, t) for(ll i = ll(n)-1; i >= ll(t); i--)
#define pb push_back
#define eb emplace_back
#define all(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vp = vector<P>;
using vvp = vector<vp>;
using vl = vector<ll>;
using vvl = vector<vl>;
const int inf = 1001001001;
const ll linf = 1001001001001001001;

template<class T>
bool chmin(T &a, T b) { return a > b ? a = b, true : false; }

template<class T>
bool chmax(T &a, T b) { return a < b ? a = b, true : false; }

void solve() {
    int n, R, r;
    cin >> n >> R >> r;
    int p = abs(R - 2 * r);
    map<int, vi> mp;
    rep(i, n) {
        int x, y;
        cin >> x >> y;
        int now = x * x + y * y;
        chmax(now, p * p);
        mp[now].pb(i + 1);
    }
    vi v = mp.begin()->second;
    cout << v.size() << '\n';
    rep(i, v.size()) cout << v[i] << " \n"[i == v.size() - 1];
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    rep(_, t) solve();
}