#include <bits/stdc++.h>

using namespace std;

int nodes, edges, u, v, triplets, visited[4097];

vector<int> adj[4097];

int main()
{
    freopen("triplete.in", "r", stdin);
    freopen("triplete.out", "w", stdout);

    scanf("%d %d", &nodes, &edges);

    for(int i = 1; i <= edges; i++)
    {
        scanf("%d %d", &u, &v);

        adj[u].push_back(v);

        adj[v].push_back(u);
    }

    for(int n = 1; n <= nodes; n++)
    {
        for(int i : adj[n])
        {
            visited[i] = n;

            for(int j : adj[i])
            {
                if(visited[j] == n)
                {
                    triplets++;
                }
            }
        }
    }

    printf("%d", triplets / 3);
}