#876 Finding Experts

Statement

Statement language

There are $N$ DOJ users. Each user has their own criteria for recognizing an expert.

User $i$ considers someone an expert if their DOJ rating is at least $A_i$ and they have solved at least $B_i$ problems on DOJ.

User $i$ has a DOJ rating of $C_i$ and has solved $D_i$ problems.

Find the number of users recognized as experts by all $N$ users, including themselves.

The input is given in the following format:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$

For each test case, print on one line the number of users recognized as experts by every user, including themselves.

#	Score	Constraints
1	8	$N=1$ .
2	21	$N \le 1\,000$ and the sum of $N$ across all test cases is at most .

Sample 1

Input

3
3
1 2 3 4
3 1 3 2
2 3 2 4
2
0 0 0 0
0 0 5 1
1
10 20 10 19

Output

1
2
0

In the first test case, only user 1 is recognized by everyone. In the second, both users are recognized. In the third, no user is recognized.

Sample 2

Input

1
2
1000000000 0 1000000000 0
0 1000000000 0 1000000000

Output

0