Capture Stars
时间限制:C/C++/Rust/Pascal 1秒,其他语言2秒
空间限制:C/C++/Rust/Pascal 256 M,其他语言512 M
64bit IO Format: %lld

题目描述

It is necessary to watch stars with the partner in passionate love. So Jack and Rose decide to watch stars this night.

In the sky, there are n stars in a rectangular Cartesian coordinate system and they have a special camera fixed in one position. This camera contains two different circles which are internally tangent. And it has a magic viewfinder which can be treated as a circle with dynamic size between the two circles (externally tangent to the small one and internally tangent to the large one) as shown in figure below. The stars in the range of the viewfinder (not on the edge) would be photographed. The problem is, what is the maximum number of stars could be photographed in one photograph?


To simplify this problem, the center of either small or large circle is on the positive side of the -axis and they are internally tangent at the origin of the coordinate system, and the stars are distinct points with integer coordinates which are guaranteed between the two circles (and not on both circles).

输入描述:

The first line contains an integer  () --- the number of test cases.

The first line of each test case contains three integers , and (, ) --- the number of stars, the radius of the large circle and the radius of the small circle.

The next n lines contain the coordinates of the stars, where the -th line contains two integers x_i, y_i () --- the coordinates of the -th star.

It's guaranteed that and , and all are pairwise different.

输出描述:

Output one integer in one line for each test case --- the maximum number of stars in one photograph.
示例1

输入

复制
1
6 5 2
4 3
6 2
6 -3
3 -4
7 4
8 -3

输出

复制
3