#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 110;

int n, R, r;
ll val[maxn];
pii a[maxn];

void work() {
  cin >> n >> R >> r;
  rep (i, 1, n) cin >> a[i].fi >> a[i].se;
  rep (i, 1, n) val[i] = 1ll * a[i].fi * a[i].fi + 1ll * a[i].se * a[i].se;
  if (R - 2 * r >= 0) {
    rep (i, 1, n) chkmx(val[i], 1ll * (R - 2 * r) * (R - 2 * r));
  }
  if (2 * r - R >= 0) {
    rep (i, 1, n) chkmx(val[i], 1ll * (2 * r - R) * (2 * r - R));
  }
  ll res = *min_element(val + 1, val + n + 1);
  int cnt = 0;
  rep (i, 1, n) if (val[i] == res) cnt++;
  cout << cnt << '\n';
  rep (i, 1, n) if (val[i] == res) cout << i << " \n"[!--cnt];
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  int t; cin >> t;
  while (t--) work();
}