#include <bits/stdc++.h>

using namespace std;

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

vector<int> adj[4097];

void DFS(int start)
{
    for(int i : adj[start])
    {
        visited[i] = start;
    }

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

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 i = 1; i <= nodes; i++)
    {
        DFS(i);
    }

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