#include <bits/extc++.h>

using ll = long long;

using pll = std::pair<ll, ll>;

template <class T>
bool chmin(T& x, const T& v) {
  if (x > v) {
    x = v;
    return true;
  } else {
    return false;
  }
}

template <class T>
bool chmax(T& x, const T& v) {
  if (x < v) {
    x = v;
    return true;
  } else {
    return false;
  }
}

void solve() {
  int N;
  ll R, r;
  std::cin >> N >> R >> r;
  std::vector<pll> ps(N);
  for (auto& [x, y] : ps) std::cin >> x >> y;

  ll tmp = R * R;

  ll K = (R - 2 * r) * (R - 2 * r);

  for (auto [x, y] : ps) {
    chmin(tmp, std::max(K, x * x + y * y));
  }

  std::vector<int> ans;

  for (int i = 0; i < N; i++) {
    auto [x, y] = ps[i];
    if (tmp == std::max(K, x * x + y * y)) {
      ans.push_back(i + 1);
    }
  }

  std::cout << ans.size() << '\n';
  for (int i = 0; i < ans.size(); i++) {
    std::cout << ans[i] << (i == ans.size() - 1 ? '\n' : ' ');
  }
}

int main() {
  int T;
  std::cin >> T;
  while (T--) {
    solve();
  }
}