Problem D: Clique

## Problem D: Clique

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 585  Solved: 196
[Submit][Status][Web Board]

## Description

Bob has a graph of n nodes and m undirected edges. These nodes are numbered from 1 to n, but he does not know how many cliques with size four in the graph. Therefore, he turns to you for help.

The definition of clique of nodes:

there is at least one edge between every two node x and y (x != y).

## Input

The first line will be an integer T, which is the number of the test cases(1 <= T <= 10). For each test case, the first line will be two integers n and m(1 <= n <= 75, 1 <= m <= 105). The following are m lines, and each line will be two integers x and y, which means there is an undirected edge between x and y.

## Output

For each test, output the number of cliques in one line.

## Sample Input

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

## Sample Output

1

[Submit][Status]