#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
using namespace std;

#define YEAR 2017
bool E[50][50];


int main()
{
	int n, m; cin >> n >> m;


	for (int i = 0; i < m; i++) {
		int a, b; cin >> a >> b;
		E[a][b] = true;
		E[b][a] = true;
	}

	int ans = 0;
	for (int i = 0; i < n; i++) {
		queue<int>que; que.push(i);
		vector<int>a(n,10000);
		a[i] = 0;
		while (!que.empty()) {
			int p = que.front();que.pop();
			for (int j = 0; j < n; j++) {
				if (i == j)continue;
				if (E[p][j]) {
					if (a[j] == 2 && a[p] == 1)ans++;
					if (a[j] == 10000)a[j] = a[p] + 1;
					if (a[p] == 0)que.push(j);
				}
			}
			for (int j = 0; j < n; j++) {
				E[p][j] = false;
				E[j][p] = false;
			}
		}
	}
	cout << ans << endl;
    return 0;
}