Monocarp is the coach of the Berland State University programming teams. He decided to compose a problemset for a training session for his teams.

Monocarp has n problems that none of his students have seen yet. The i-th problem has a topic a_i (an integer from 1 to n) and a difficulty b_i (an integer from 1 to n). All problems are different, that is, there are no two tasks that have the same topic and difficulty at the same time.

Monocarp decided to select exactly 3 problems from n problems for the problemset. The problems should satisfy at least one of two conditions (possibly, both):

  * the topics of all three selected problems are different; 
  * the difficulties of all three selected problems are different. 



Your task is to determine the number of ways to select three problems for the problemset.

Input

The first line contains a single integer t (1 ≤ t ≤ 50000) — the number of testcases.

The first line of each testcase contains an integer n (3 ≤ n ≤ 2 ⋅ 10^5) — the number of problems that Monocarp have.

In the i-th of the following n lines, there are two integers a_i and b_i (1 ≤ a_i, b_i ≤ n) — the topic and the difficulty of the i-th problem.

It is guaranteed that there are no two problems that have the same topic and difficulty at the same time.

The sum of n over all testcases doesn't exceed 2 ⋅ 10^5.

Output

Print the number of ways to select three training problems that meet either of the requirements described in the statement.

Example

Input


2
4
2 4
3 4
2 1
1 3
5
1 5
2 4
3 3
4 2
5 1


Output


3
10

Note

In the first example, you can take the following sets of three problems:

  * problems 1, 2, 4; 
  * problems 1, 3, 4; 
  * problems 2, 3, 4. 



Thus, the number of ways is equal to three.
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.StringTokenizer;


import java.io.*;
 
public class cf745 {
	
	private static class MyScanner {
	    BufferedReader br;
	    StringTokenizer st;
 
	    public MyScanner() {
	       br = new BufferedReader(new InputStreamReader(System.in));
	    }
 
	    String next() {
	        while (st == null || !st.hasMoreElements()) {
	            try {
	                st = new StringTokenizer(br.readLine());
	            } catch (IOException e) {
	                e.printStackTrace();
	            }
	        }
	        return st.nextToken();
	    }
 
	    int nextInt() {
	        return Integer.parseInt(next());
	    }
 
	    long nextLong() {
	        return Long.parseLong(next());
	    }
 
	    double nextDouble() {
	        return Double.parseDouble(next());
	    }
 
	    String nextLine(){
	        String str = "";
		  try {
		     str = br.readLine();
		  } catch (IOException e) {
		     e.printStackTrace();
		  }
		  return str;
	    }
 
	 }
	
	
	public static long solution(int[][] arr, long n)	
	{
			HashMap<Integer,Long> amap = new HashMap<>();
			HashMap<Integer,Long> bmap = new HashMap<>();
			
			for(int i = 0; i<n; i++)
			{
				amap.merge(arr[i][0],(long)1,Long::sum);
				bmap.merge(arr[i][1],(long)1,Long::sum);
			}
			
			long ans = 0;
			
			for(int i = 0; i<n; i++)
			{
				int a = arr[i][0];
				int b = arr[i][1];
				
				ans+=((amap.get(a)-1)*(bmap.get(b)-1));
			}
		
			return (n*(n-1)*(n-2))/6 - ans;
	}
	
	
private static PrintWriter out = new PrintWriter(System.out);
 
public static void main (String[] args)
{
	MyScanner s =  new MyScanner();
   
    int t = s.nextInt();
    
    for(int j = 0; j<t ; j++)
    {
    	int n = s.nextInt();
    	int[][] arr = new int[n][2];
    	
    	for(int i =0; i<n; i++)
    		{  
    		   arr[i][0] = s.nextInt();
    		   arr[i][1] = s.nextInt();
    		}
    	
    	out.println(solution(arr,n));
    }
    
    
    out.flush();
    out.close();
}
}