#include<bits/stdc++.h>
using namespace std;
ifstream f("triplete.in");
ofstream g("triplete.out");
int n,m,i,sol,A[66000],B[66000];
bitset <4100> G[4100];
int main()
{
    f>>n>>m;
    for(i=1;i<=m;++i)
    {
        f>>A[i]>>B[i];
        if(A[i]<B[i]) G[A[i]].set(B[i]);
        else G[B[i]].set(A[i]);
    }
    for(i=1;i<=m;++i)
        sol+=(G[A[i]]&G[B[i]]).count();
    g<<sol;
    return 0;
}