#include <iostream>
#include <fstream>
#include <algorithm>
#include <bitset>
using namespace std;
ifstream fin("triplete.in");
ofstream fout("triplete.out");
bitset<4096>a[4096];
pair<int, int> b[65600];
int n, m;

int main()
{
    int i, j, x, y, cnt;
    fin >> n >> m;
    for (i = 0; i < m; i++)
    {
        fin >> x >> y;
        x--; y--;
        if (y > x)swap(x, y);
        b[i].first = y;
        b[i].second = x;
        a[y][x]=1;///prieten comun intre y si x
    }
    cnt = 0;
    for (i = 0; i < m; i++)
    {
        y = b[i].first;
        x = b[i].second;
        cnt += (a[y] & a[x]).count();///Nr de prietenii comuni dintre y si x
    }
    fout << cnt;
    return 0;
}