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

using namespace std;

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

int N, M;
const int NMAX = 4100;
bitset <NMAX> friendships[NMAX];

void Read(){
    in >> N >> M;
    for(int i = 1; i <= M; ++i){
        int a, b;
        in >> a >> b;
        friendships[a][b] = 1;
        friendships[b][a] = 1;
    }
}

void SolveAndPrint(){
    int sol = 0;
    for(int i = 1; i <= N; ++i){
        for(int j = 1; j <= N; ++j){
            if(i != j && friendships[i][j] == 1)
                sol += (friendships[i] & friendships[j]).count();
        }
    }
    out << sol / 6 << "\n";
}


int main(){
    Read();
    SolveAndPrint();
    return 0;
}