Lead or Butterfly

Yonghan is afraid of bugs. Seongwoo wants to help Yonghan stop being afraid of them, so he decides to use the butterfly, a pretty insect.

First, Seongwoo draws $N$ points and $M$ edges on a very large sheet of paper. Then he picks 7 distinct points in order. Call them $a, b, c, d, e, f, g$. If the segments $(a, b)$, $(b, c)$, $(a, c)$, $(c, d)$, $(c, e)$, $(d, e)$, $(c, f)$, and $(c, g)$ all exist, Seongwoo calls this a 'butterfly'.

For two butterflies, if their sets of edges are the same, the two butterflies are treated as the same butterfly. Any two butterflies that do not satisfy this condition are different butterflies.

Seongwoo wants to know how many different butterflies he can draw. Find this for him.

Note that there is at most one edge between any two points in the given graph, and the order of vertices is not considered.

The first line contains the number of points $N$ and the number of edges $M$. ($1 \leq N \leq 500$, $1 \le M \le \frac{N(N-1)}{2}$)

Each of the next $M$ lines contains two distinct integers $a_i$ and $b_i$, separated by a space, which are the two endpoints of the $i$-th edge, where $1 \leq i \leq M$.

Print the number of different butterflies Seongwoo can draw.