#include <cstdio>
#include <bitset>
using namespace std;

int vertices, edges, answer, u, v;
int A[65536], B[65536];
bitset<4096> adj[4096];

int main(){

    freopen("triplete.in", "r", stdin);
    freopen("triplete.out", "w", stdout);

    scanf("%d %d", &edges, &vertices);

    for(int i = 0; i < edges; i++){

        scanf("%d %d", &u, &v);

        u--; A[i] = u;
        v--; B[i] = v;

        adj[A[i]].set(B[i]);
        adj[B[i]].set(A[i]);
    }

    for(int i = 0; i < edges; i++){
        answer += (adj[A[i]] & adj[B[i]]).count();
    }

    printf("%d", answer / 3);

    return 0;
}