#include <bits/stdc++.h>

using namespace std;

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

vector<int> adj[4097];

char buffer[1048576]; int i = 1048575;

inline int get_nr()
{
    int x = 0;

    while(buffer[i] < 48 | buffer[i] > 57)

        if(++i == 1048576) fread(buffer, 1, 1048576, stdin), i = 0;

    while(buffer[i] > 47 & buffer[i] < 58)
    {
        x = x * 10 + buffer[i] - 48;

        if(++i == 1048576) fread(buffer, 1, 1048576, stdin), i = 0;
    }

    return x;
}

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);

    nodes = get_nr();

    edges = get_nr();

    for(int i = 1; i <= edges; i++)
    {
        u = get_nr();

        v = get_nr();

        adj[u].push_back(v);

        adj[v].push_back(u);
    }

    for(int i = 1; i <= nodes; i++)
    {
        DFS(i);
    }

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