#include <cstdio>
#include <vector>
#include <bitset>
#include <algorithm>

#define F first
#define S second

using namespace std;

const int Nmax = (1 << 12);

int n , m;
vector < pair < int , int > > q;
bitset < Nmax > g[Nmax];

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

    scanf("%d %d", &n, &m);

    q = vector < pair < int , int > > (m);
    for (auto &it : q)
    {
        scanf("%d %d", &it.F, &it.S);
        it.F--; it.S--;
        g[it.F][it.S] = 1;
        g[it.S][it.F] = 1;
    }

    long long ans = 0;

    for (auto &it : q)
        ans += 1LL * (g[it.F] & g[it.S]).count();

    printf("%lld\n", ans / 3);

    return 0;
}