{"raw_statement":[{"iden":"problem statement","content":"You are given a simple undirected graph with $N$ vertices and $M$ edges. The vertices are numbered $1, \\dots, N$, and the $i$\\-th $(1 \\leq i \\leq M)$ edge connects Vertex $U_i$ and Vertex $V_i$.\nFind the number of tuples of integers $a, b, c$ that satisfy all of the following conditions:\n\n*   $1 \\leq a \\lt b \\lt c \\leq N$\n*   There is an edge connecting Vertex $a$ and Vertex $b$.\n*   There is an edge connecting Vertex $b$ and Vertex $c$.\n*   There is an edge connecting Vertex $c$ and Vertex $a$."},{"iden":"constraints","content":"*   $3 \\leq N \\leq 100$\n*   $1 \\leq M \\leq \\frac{N(N - 1)}{2}$\n*   $1 \\leq U_i \\lt V_i \\leq N \\, (1 \\leq i \\leq M)$\n*   $(U_i, V_i) \\neq (U_j, V_j) \\, (i \\neq j)$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $M$\n$U_1$ $V_1$\n$\\vdots$\n$U_M$ $V_M$"},{"iden":"sample input 1","content":"5 6\n1 5\n4 5\n2 3\n1 4\n3 5\n2 5"},{"iden":"sample output 1","content":"2\n\n$(a, b, c) = (1, 4, 5), (2, 3, 5)$ satisfy the conditions."},{"iden":"sample input 2","content":"3 1\n1 2"},{"iden":"sample output 2","content":"0"},{"iden":"sample input 3","content":"7 10\n1 7\n5 7\n2 5\n3 6\n4 7\n1 5\n2 4\n1 3\n1 6\n2 7"},{"iden":"sample output 3","content":"4"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}