// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return b < a ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

int t;
int n, R, r;
ii xy[MAXN];

int getd(ii p) {
    return p.FI * p.FI + p.SE * p.SE;
}

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> t;
    while (t--) {
        cin >> n >> R >> r;
        vi ans;
        int mn = INF;
        REP (i, 1, n + 1) {
            cin >> xy[i].FI >> xy[i].SE;
            if (getd(xy[i]) <= getd({2 * r - R, 0})) {
                if (mn != -1) {
                    mn = -1;
                    ans.clear();
                }
                ans.pb(i);
            } else {
                if (mnto(mn, getd(xy[i]))) {
                    ans.clear();
                }
                if (mn == getd(xy[i])) {
                    ans.pb(i);
                }
            }
        }
        cout << SZ(ans) << '\n';
        REP (i, 0, SZ(ans)) {
            cout << ans[i] << " \n"[i + 1 == SZ(ans)];
        }
    }
    return 0;
}