#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;i<n;i++)
#define REP(i,a,n) for(ll i=a;i<n;i++)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(i,v) for(auto& i : v)
#define UQ(v) sort(be(v)), v.erase(unique(be(v)), v.end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define dout()  cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))

template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }




void solve(){
    ll n,R,r;
    cin >> n >> R >> r;
    vector<pair<ll,ll>> b(n);
    rep(i,n){
        ll x,y;
        cin >> x >> y;
        b[i] = {x*x+y*y, i};
    }
    sort(be(b));
    V<ll> ans;
    if(0){
        // V<ll> ans;
        ll x = b[0].first;
        for(auto[a,c]:b) if(a == x){
            ans.eb(c);
        }
    }else{
        // V<ll> ans;
        for(auto[a,c]:b) if((2*r-R)*(2*r-R) >= a){
            ans.eb(c);
        }
        if(ans.empty()){
            
        ll x = b[0].first;
            for(auto[a,c]:b) if(a == x){
                ans.eb(c);
            }
        }
    }
    cout << ans.size() << endl;
    ll m = ans.size();
    sort(be(ans));
    for(int i=0;i<ans.size();i++){
        cout << ans[i]+1;
        if(i!=m-1) cout << " ";
    }
    cout << endl;
}





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