#include <fstream>
#include <iostream>
#include <bitset>

using namespace std;

#define nmax 4099
#define nrmax (1<<21)

ifstream f("triplete.in");
ofstream g("triplete.out");

int n, m;
int a[nmax][nmax/20 + 1];
int nr[nrmax];
int A[nmax], B[nmax];

void citeste(){

    f >> n >> m;
    for(int i=1; i<=m; i++){
        int x, y;
        f >> x >> y;
        a[x][y/20] += (1<<(y % 20));
        a[y][x/20] += (1<<(x % 20));
        A[i] = x;
        B[i] = y;
    }

}

void rezolva(){

    int cnt = 0;

    //nr[i] = numarul de biti de 1 din reprezentarea binara a lui 'i';
    for(int i=1; i<nrmax; i++)
        nr[i] = nr[i/2] + (i%2);


    for(int i=1; i<=m; i++){
        int x = A[i];
        int y = B[i];
        for(int j=0; j<=n/20; j++){
            cnt += nr[(a[x][j]&a[y][j])];
        }
    }

    cout << cnt/3 << "\n";
    g << cnt/3 << "\n";


}

int main(){

    citeste();
    rezolva();

    f.close();
    g.close();

    return 0;

}