#include <bits/stdc++.h>

using namespace std;

int main()
{
	cin.tie(0)->sync_with_stdio(0);

	int tc;
	cin >> tc;
	while (tc--)
	{
		int n, R, r;
		cin >> n >> R >> r;
		int lim = R - 2 * r;
		lim *= lim;
		vector<int> ans;
		int best = INT_MAX;

		for (int i = 1; i <= n; i++)
		{
			int x, y;
			cin >> x >> y;
			int cur = max(lim, x * x + y * y);
			if (cur < best)
			{
				best = cur;
				ans.clear();
			}
			if (cur == best)
				ans.push_back(i);
		}

		cout << size(ans) << '\n' << ans[0];
		for (int i = 1; i < (int)size(ans); i++)
			cout << ' ' << ans[i];
		cout << '\n';
	}
}