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

long long T;
long long N, A, B;
long long X[1 << 19];
long long Y[1 << 19];

vector<int> Solve() {
	vector<int> Answer;
	long long best = (1LL << 60);
	long long v = min(A, B - A);
	long long lower = (B - 2 * v) * (B - 2 * v);
	long long upper = B * B;

	// Brute Force
	for (int i = 1; i <= N; i++) {
		long long Dist = X[i] * X[i] + Y[i] * Y[i];
		Dist = max(lower, min(upper, Dist));
		// cout << "! " << i << " " << Dist << endl;
		if (best > Dist) {
			best = Dist;
			Answer.clear();
		}
		if (best == Dist) Answer.push_back(i);
	}
	return Answer;
}

int main() {
	cin >> T;
	for (int t = 1; t <= T; t++) {
		cin >> N >> B >> A;
		for (int i = 1; i <= N; i++) cin >> X[i] >> Y[i];
		vector<int> Answer = Solve();
		cout << Answer.size() << endl;
		for (int i = 0; i < (int)Answer.size(); i++) {
			if (i >= 1) cout << " ";
			cout << Answer[i];
		}
		cout << endl;
	}
	return 0;
}