#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


Int sq(Int t) {
  return t * t;
}

int N;
Int R, S;
vector<Int> X, Y;

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d%lld%lld", &N, &R, &S);
    X.resize(N);
    Y.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%lld%lld", &X[i], &Y[i]);
    }
    
    const Int a = sq(R - 2 * S);
    const Int b = sq(R);
    
    vector<Int> ds(N);
    for (int i = 0; i < N; ++i) {
      ds[i] = sq(X[i]) + sq(Y[i]);
      ds[i] = min(max(ds[i], a), b);
    }
// cerr<<a<<" "<<b<<" "<<ds<<endl;
    const Int minD = *min_element(ds.begin(), ds.end());
    vector<int> ans;
    for (int i = 0; i < N; ++i) {
      if (minD == ds[i]) ans.push_back(i);
    }
    
    printf("%d\n", (int)ans.size());
    for (int h = 0; h < (int)ans.size(); ++h) {
      if (h) printf(" ");
      printf("%d", ans[h] + 1);
    }
    puts("");
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}