Y

Hujaro is studying graph theory and found an interesting graph. Call a simple undirected graph a Y if it has the following properties:

• It has 4 vertices and 3 edges.
• One vertex is called the root, and the other 3 vertices are called leaves.
• Each of the 3 edges connects one leaf to the root.

Hujaro thinks the properties of Y are very unusual, so he decided to count how many Ys appear in a given graph. In a simple undirected graph, the number of Ys is defined as follows:

• Choose 3 edges from the graph without regard to order. If these edges, together with the vertices they connect, form a Y, that choice counts once. The number of Ys in the graph is the number of such choices.

Given a simple undirected graph, print the number of Ys in it. The count can be very large, so print the remainder when it is divided by $10^{9}+7$.

The first line contains the number of vertices $n$ and the number of edges $m$, separated by a space. ($1 \le n \le 10^5$, $0 \le m \le \min(\frac{n(n-1)}{2},2\times 10^5)$)

Each of the next $m$ lines contains two vertices $u$ and $v$ connected by an edge, separated by a space. ($1 \le u,v \le n$, $u \neq v$)

The graph has no multiple edges and no edges whose two endpoints are the same vertex.

Print the number of Ys in the given graph, modulo $10^{9}+7$.