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

#define DIM (1<<12)+(1<<4)
using namespace std;

unsigned int N, M, sol, X, Y;
unsigned int V[DIM*16], W[DIM*16];
bitset<DIM> A[DIM];

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);

	if(X > Y) 
		swap(X, Y);

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

	A[X][Y] = 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;
}