//  _                          _   _                            
// | |   ___    _ __     ___  | | (_)  _ __     ___   ___   ___ 
// | |  / _ \  | '_ \   / _ \ | | | | | '_ \   / _ \ / __| / __|
// | | | (_) | | | | | |  __/ | | | | | | | | |  __/ \__ \ \__ \
// |_|  \___/  |_| |_|  \___| |_| |_| |_| |_|  \___| |___/ |___/
//                                                              
#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<int>a(n);
    int minn = 1e9;
    for(int i= 0;i < n;i ++){
        int x,y;
        cin>>x>>y;
        a[i]=abs(r*r-x*x-y*y);
        minn= min(minn,a[i]);
    }
    vector<int>ans;
    for(int i= 0;i < n;i ++){
        if(a[i]==minn)ans.push_back(i+1);
    }
    cout<<ans.size()<<endl;
    for(int i = 0;i < ans.size()-1;i ++)cout<<ans[i]<<' ';
    cout<<ans[ans.size()-1];
    cout<<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;
}