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).