#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=5005;
ll dis[maxn];
void solve() {
    int n;cin>>n;
    ll R,r;cin>>R>>r;
    R=R-2*r;
    ll mdis=1e18;
    for(int i=1;i<=n;i++) {
        ll x,y;cin>>x>>y;
        dis[i]=max(R*R,x*x+y*y);
        mdis=min(mdis,dis[i]);
    }
    vector<int> ans;
    for(int i=1;i<=n;i++) {
        if(mdis==dis[i]) ans.push_back(i);
    }
    printf("%d\n",ans.size());
    //for(auto x:ans) printf("%d ",x);
    for(int i=0;i<ans.size()-1;i++) printf("%d ",ans[i]);
    printf("%d\n",ans.back());
}
int main() {
    int t;cin>>t;
    while(t--) solve();
    return 0;

}