#include <cstdio>
#include <bitset>
#include <algorithm>

#define DIM1 4100
#define DIM2 66000
using namespace std;

int N, M, X, Y;
int V[DIM2], W[DIM2];

int sol;

bitset<DIM1> A[DIM1];

int main(){

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

	scanf("%d %d", &N, &M);
	for(int i = 1; i <= M; i ++){
		scanf("%d %d", &X, &Y);

		V[i] = --X;
		W[i] = --Y;

		A[min(X, Y)][max(X, Y)+2] = 1;
	}

	for(int i = 1; i <= M; i ++)
		sol += ( A[ V[i] ]&A[ W[i] ] ).count();

	printf("%d\n", sol);

	fclose(stdin );
	fclose(stdout);

	return 0;
}