After obtaining a lot of gold from capturing different kingdoms, King Kala buys a large area of land. N trees are planted on the land, numbered from 1 to N. Each tree i, has coordinates as Xi, Yi. King Kala has two sons who, as their father, are selfish. To divide the land between two sons, King Kala draws a partition line on the land which is given by three coefficients of the line equation A, B and C. Now, Prince Parmar, being the elder son got a chance to pick any one side. But he wants the side of the partition which contains the maximum number of trees. How many trees can he get?

Input

The first line contains the number of test cases T. In each test case, the first line contains N. The next line contains three space separated integers A, B and C. The next N lines contain Xi, Yi which are the co-ordinates of N trees.

Output

For each test case, print the maximum number of trees which are completely on one side of the partition line.

Constraints

1 ≤ T ≤10
1 ≤ N ≤ 10^5
-100 ≤ A,B ≤ 100
-10^5 ≤ C, Xi, Yi ≤ 10^5

SAMPLE INPUT
1
4
1 -1 0
2 1
1 3
4 2
3 3

SAMPLE OUTPUT
2

见题面

见题面