#include <bits/stdc++.h>
using namespace std;
const int inf=1e9;
struct point{
    int x,y;
};
int dis(point x,point y){
    return (x.x-y.x)*(x.x-y.x)+(x.y-y.y)*(x.y-y.y);
}
void solve()
{
    int n,R,r;cin>>n>>R>>r;
    point zero{0,0};
    vector<pair<int,int>> a;
    for(int i=1;i<=n;i++){
        int x,y;cin>>x>>y;
        point p{x,y};
        a.emplace_back(dis(p,zero),i);
    }
    sort(a.begin(),a.end());
    int g=r*2-R;
    g=g;g=g*g;
    vector<int>ans;
    if(a.front().first<=g){
        for(int i=0;i<n;i++)if(a[i].first<=g)ans.push_back(a[i].second);
    }
    else{
        for(int i=0;i<n;i++)if(a[i].first==a[0].first)ans.push_back(a[i].second);
    }
    sort(ans.begin(),ans.end());
    cout<<ans.size()<<"\n";
    for(int i=0;i<ans.size();i++)cout<<ans[i]<<" \n"[i==ans.size()-1];
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;cin>>T;while(T--){
        solve();
    }
}
/*
3
3 10 5
3 4
3 5
3 6
3 10 4
-7 -6
4 5
5 4
2 10 10
1 5
1 6
*/