#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

void out(vi ans){
    sort(all(ans));
    cout<<si(ans)<<"\n";
    for(int i=0;i<si(ans);i++){
        if(i) cout<<" ";
        cout<<ans[i]+1;
    }
    cout<<"\n";
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        ll N,R,r;cin>>N>>R>>r;
        vector<pair<ll,int>> D(N);
        for(int i=0;i<N;i++){
            ll a,b;cin>>a>>b;
            D[i].fi=a*a+b*b;
            D[i].se=i;
        }
        sort(all(D));
        ll sf=(R-2*r)*(R-2*r);
        if(D[0].fi<=sf){
            vi ans;
            for(int i=0;i<N;i++){
                if(D[i].fi<=sf) ans.pb(D[i].se);
            }
            out(ans);
        }else{
            vi ans;
            for(int i=0;i<N;i++){
                if(D[i].fi==D[0].fi) ans.pb(D[i].se);
            }
            out(ans);
        }
    }
}