//  _                          _   _                            
// | |   ___    _ __     ___  | | (_)  _ __     ___   ___   ___ 
// | |  / _ \  | '_ \   / _ \ | | | | | '_ \   / _ \ / __| / __|
// | | | (_) | | | | | |  __/ | | | | | | | | |  __/ \__ \ \__ \
// |_|  \___/  |_| |_|  \___| |_| |_| |_| |_|  \___| |___/ |___/
//                                                              
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<set>
#include<map>
#include<cmath>
#include<unordered_map>
using namespace std;
#define int long long
#define endl "\n"
const int N = 1e6+10,mod=1e9+13;

typedef pair<int,int> PII;
int n,m;
void solve()
{
    int R,r;
    cin>>n>>R>>r;
    vector<PII>a(n);
    for(int i = 0;i < n;i ++){
        int x,y;
        cin>>x>>y;
        a[i].first=max(x*x+y*y,(R-2*r)*(R-2*r));
        a[i].second = i+1;
    }
    sort(a.begin(),a.end());
    int ans = 0;
    while(ans<n&&a[ans].first==a[0].first)ans++;
    cout<<ans<<endl;
    for(int i= 0;i < ans-1;i ++)cout<<a[i].second<<' ';
    cout<<a[ans-1].second<<endl;
}
signed  main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0);
    int t=1;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}