#include <bits/stdc++.h>
using namespace std;
vector <short int> g[4100];
bool in[4100];
inline int dfs(int tata)
{
    int ret = 0;
    for (auto &it : g[tata])
        in[it] = true;
    for (auto &it : g[tata])
    {
        int nod = it;
        if (nod > tata)
            for (auto &itt : g[nod])
                if (in[itt] && itt > nod)
                    ++ret;
    }
    for (auto &it : g[tata])
        in[it] = false;
    return ret;
}
int main()
{
    freopen("triplete.in", "r", stdin);
    freopen("triplete.out", "w", stdout);

    int n , m;
    scanf("%d %d\n", &n, &m);
    for (int i = 1; i<=m; ++i)
    {
        int x , y;
        scanf("%d %d\n", &x, &y);
        g[x].push_back(y);
        g[y].push_back(x);
    }
    int ret = 0;
    for (int i = 1; i<= n - 2; ++i)
        ret += dfs(i);
    printf("%d\n", ret);
    return 0;
}