Suppose that G is an undirected graph, and the value of
stab is defined as follows:
Among the expression,G
-i, -j is the remainder after removing node i, node j and all edges that are directly relevant to the previous two nodes.
cntCompent is the number of connected components of X independently.
Thus, given a certain undirected graph G, you are supposed to calculating the value of
stab.
The input will contain the description of several graphs. For each graph, the description consist of an integer N for the number of nodes, an integer M for the number of edges, and M pairs of integers for edges (3<=N,M<=5000).
Please note that the endpoints of edge is marked in the range of [0,N-1], and input cases ends with EOF.
For each graph in the input, you should output the value of
stab.