#include <bitset>
#include <stdio.h>
using namespace std;

bitset<4097> G[4097];
int N, M, X[65537], Y[65537];

int main() {
    freopen("triplete.out", "w", stdout);
    freopen("triplete.in", "r", stdin);
    scanf("%d %d", &N, &M);
    for(int i = 0 ; i < M ; ++ i) {
        int x, y;
        scanf("%d %d", &x, &y);
        X[i] = x;
        Y[i] = y;
        G[x][y] = 1;
        G[y][x] = 1;
    }
    int Ans = 0;
    for(int i = 0 ; i < M ; ++ i)
        Ans += ((bitset<4097>)G[X[i]]&G[Y[i]]).count();
    printf("%d\n", (int)Ans/3);
    return 0;
}