Time Limit: 1000 MS    Memory Limit: 131072 K 


Description

Mathon likes watching stars. One night, there were n stars in the sky. Mathon lined them with m edges without multiple edges and self-loops. Mathon wanted to find his favorite "Mathon structure". A Mathon structure is defined as an undirected graph, G = V + E. V = (A, B, C, D), E = (AB, BC, CD, DA, AC), AC means an undirected edges connected by point A and point C. If two structures has the same V and E, we will see them as the same. Now, given n stars and m edges, can you tell Mathon how many different Mathon structure are there in the sky?

Input

The first line contains an integer T: the number of cases. For each case, the first line contains n and m (4<=n<=?10^5, 1<=?m<=?min(10^5, n * (n - 1) / 2)): the number of stars and edges. Each of the next m lines contains two integers x and y (1<=x,?y<=?n): two endpoints of an edge.

Output

For each case output your answer on a single line.

Sample Input

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

Sample Output

2