Compo

Ahmed is the head of systems for a collegiate programming contest. Back in college he predicted the output of programs without compiling or running them, so his colleagues started calling him Compo, short for compiler.

Ahmed is often asked to help organize contests, and he almost always agrees. The catch is that if he takes a contest that runs from time $C_l$ to time $C_r$, he has to stay there from the start of the contest until it ends.

Sometimes two or more contests overlap. When one contest starts before another one finishes, Ahmed can attend only one of them, and the contest managers fight over who gets his help.

The managers of two overlapping contests fight each other once. So a contest that overlaps $M$ other contests costs its manager $M$ fights, and the total number of fights equals the number of pairs of contests whose time ranges overlap. Two contests also count as overlapping when one ends at exactly the time the other starts, because Ahmed is not that fast.

You are given the number of contests and the start and end times of each one. Count the number of fights.

The first line contains a single integer $T$, the number of test cases ($1 \le T \le 100$).

The first line of each test case contains a single integer $N$, the number of contests ($1 \le N \le 10^5$). Each of the next $N$ lines contains two integers $C_l$ and $C_r$ separated by a space, the start and end times of that contest ($1 \le C_l \le C_r \le 10^9$).

For each test case, print one line in the form Case n: R, where $n$ is the test case number starting from 1 and $R$ is the number of fights in that test case.

$R$ can exceed the range of a 32-bit integer.