#include <bits/stdc++.h>
using namespace std;

using ll = long long;

template<class T>
bool chmin(T &a, const T &b) {if (a > b) {a = b; return 1;} return 0;}

void solve() {
  ll N, R, r; cin >> N >> R >> r;
  vector<array<ll, 2>> pos(N);
  for (ll i = 0; i < N; ++i) {
    ll x, y; cin >> x >> y;
    pos[i] = {x, y};
  }
  const ll INF = 1e15;

  vector<array<ll, 2>> norm;
  vector<ll> res;
  ll base = (R - 2 * r);
  for (ll i = 0; i < N; ++i) {
    auto [x, y] = pos[i];
    ll xy = x * x + y * y;
    if (base >= 0 && xy <= base * base) norm.emplace_back(array<ll, 2>({0, i}));
    else if (base <= 0 && xy <= base * base) norm.emplace_back(array<ll, 2>({0, i}));
    else if (xy > R * R) norm.emplace_back(array<ll, 2>({R * R, i}));
    else norm.emplace_back(array<ll, 2>({xy, i}));
  }

  if (res.empty()) {
    sort(norm.begin(), norm.end());
    for (ll i = 0; i < N; ++i) {
      if (norm[i][0] == norm[0][0]) res.emplace_back(norm[i][1]);
    }
    sort(res.begin(), res.end());
  }

  cout << res.size() << endl;
  ll s = res.size();
  for (ll i = 0; i < s; ++i) {
    cout << res[i]+1 << " \n"[i+1==s];
  }

  return;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);

  ll T; cin >> T;
  while (T--) {
    solve();
  }

  return 0;
}