#include <fstream>
#include <vector>
#include <cstring>
#include <queue>
using namespace std;
ifstream f("triplete.in");
ofstream g("triplete.out");
int N,M;
int Result;
vector <int> G[4105];
int D[4105];
bool Use[4105];
queue <int> Q;
void Read()
{
    int i;
    f>>N>>M;
    for(int i=1;i<=M;i++)
    {
        int x,y;
        f>>x>>y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
}

void BFS(int S)
{
    Q.push(S);
    D[S]=0;
    while(!Q.empty())
    {
        int nod=Q.front();Q.pop();
        if(D[nod]>=2)
            return;
        for(unsigned int j=0;j<G[nod].size();j++)
        {
            if(D[G[nod][j]]==-1)
            {
                Q.push(G[nod][j]);
                D[G[nod][j]]=D[nod]+1;
            }
            else
                if(D[nod]==1 && D[G[nod][j]]==1)
                    Result++;
        }
    }
}

void Browse()
{
    int i;
    for(i=1;i<=N;i++)
    {
        memset(D,-1,sizeof(D));
        BFS(i);
         while(!Q.empty())
            Q.pop();
    }
    g<<Result/6<<"\n";
}
int main()
{
    Read();
    Browse();
    return 0;
}