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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class Main {
    private static final FastReader fs = new FastReader();
    private static final PrintWriter out = new PrintWriter(System.out);
    private static long m = 1_000_000_009;
    private static long p = 31;
    private static long mod = 1_000_000_007;
    private static long ool = 1_000_000_000_000_000_009l;
    private static int ooi = 1_000_000_009;

    static class Pair {
        long count;
        Map<Integer, Integer> mp;

        public Pair(long count, HashMap<Integer, Integer> mp){
            this.count = count;
            this.mp = mp;
        }
    }

    private static void solve() {
        long n = fs.nextInt();
        long ans = (n * (n - 1) * (n - 2)) / 6;
        Map<Integer, List<Integer>> mp1 = new HashMap<>();
        Map<Integer, Long> mp2 = new HashMap<>();
        for(int i = 0; i < n; i++){
            int t = fs.nextInt(), d = fs.nextInt();
            List<Integer> tmp = mp1.getOrDefault(d, new ArrayList<>());
            tmp.add(t);
            mp1.put(d, tmp);
            mp2.put(t, mp2.getOrDefault(t, 0l) + 1);
        }
        for(Map.Entry<Integer, List<Integer>> ele : mp1.entrySet()){
            List<Integer> val = ele.getValue();
            if(val.size() > 1){
                long sum = 0l;
                for(int i = 0; i < val.size(); i++) sum += (mp2.get(val.get(i)) - 1) * (val.size() - i - 1);
                ans -= sum;
            }
        }
        out.println(ans);
    }

    public static void main(String[] args) {
        Thread t = new Thread(null, null, "", 1 << 28) {
            public void run() {
                int test_case = 1;
                test_case = fs.nextInt();
                for (int cs = 1; cs <= test_case; cs++)
                    solve();
                out.close();
            }
        };
        t.start();
        try {
            t.join();
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
    }

    private static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            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;
        }

        int[] readintarray(int n) {
            int res[] = new int[n];
            for (int i = 0; i < n; i++)
                res[i] = nextInt();
            return res;
        }

        long[] readlongarray(int n) {
            long res[] = new long[n];
            for (int i = 0; i < n; i++)
                res[i] = nextLong();
            return res;
        }
    }

    private static int max(int... arg) {
        int length = arg.length;
        if(length == 0)
            throw null;
        int maxVal = arg[0];
        for(int i = 1; i < length; i++)
            maxVal = Math.max(maxVal, arg[i]);
        return maxVal;
    }

    private static int min(int... arg) {
        int length = arg.length;
        if(length == 0)
            throw null;
        int maxVal = arg[0];
        for(int i = 1; i < length; i++)
            maxVal = Math.min(maxVal, arg[i]);
        return maxVal;
    }

    private static long max(long... arg) {
        int length = arg.length;
        if(length == 0)
            throw null;
        long maxVal = arg[0];
        for(int i = 1; i < length; i++)
            maxVal = Math.max(maxVal, arg[i]);
        return maxVal;
    }

    private static long min(long... arg) {
        int length = arg.length;
        if(length == 0)
            throw null;
        long maxVal = arg[0];
        for(int i = 1; i < length; i++)
            maxVal = Math.min(maxVal, arg[i]);
        return maxVal;
    }

    private static int abs(int a) {
        return a >= 0 ? a : -a;
    }

    private static int abs(int a, int b) {
        return a-b >= 0 ? a-b : b-a;
    }

    private static long abs(long a) {
        return a >= 0 ? a : -a;
    }

    private static long abs(long a, long b) {
        return a-b >= 0 ? a-b : b-a;
    }

    private static int power(int base, int exponent) {
        int res = 1;
        while(exponent > 0) {
            if((exponent & 1) != 0)
                res *= base;
            exponent >>= 1;
            base *= base;
        }
        return res;
    }

    private static long power(long base, long exponent) {
        long res = 1;
        while(exponent > 0) {
            if((exponent & 1) != 0)
                res *= base;
            exponent >>= 1;
            base *= base;
        }
        return res;
    }

    private static long mPower(long base, long exponent) throws Exception {
        long res = 1;
        base %= mod;
        while(exponent > 0) {
            if((exponent & 1) != 0)
                res = mul(res, base);
            exponent >>= 1;
            base = mul(base, base);
        }
        return res;
    }

    private static long mul(long a, long b) {
        return a*b % mod;
    }

    private static long add(long a, long b) {
        return (a+b) % mod;
    }

    private static long sub(long a, long b) {
        long res = (a - b) % mod;
        if(res < 0)
            res += mod;
        return res;
    }

    private static long xor(long n){
        long r = n % 4;
        if(r == 0)
            return n;
        else if(r == 1)
            return 1;
        else if(r == 2)
            return n+1;
        else
            return 0;
    }
}