/**
 *      Author:  Nicholas Winschel
 *      Created: 08.29.2023 16:52:11
**/

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using db=long double;
template<class T> using V=vector<T>;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int,int>;
#define f first
#define s second
#define sz(x) (int)((x).size())

int main() {
	cin.tie(0)->sync_with_stdio(0); // initialize fast I/O

	int n, m; cin >> n >> m;
	V<pi> edgs; edgs.reserve(m);
	vi cnt(n);
	for (int i = 0; i < m; i++) {
		int u, v; cin >> u >> v;
		u--,v--;
		cnt[u]++, cnt[v]++;
		edgs.emplace_back(u,v);
	}
	vi dec(n); iota(dec.begin(), dec.end(), 0);
	sort(dec.begin(), dec.end(), [&](int x, int y) -> bool {
		return cnt[x] < cnt[y];
	});
	vi enc(n);
	for (int i = 0; i < n; i++) enc[dec[i]]=i;
	V<vi> adj(n);
	for (auto &&p : edgs) {
		p.f = enc[p.f];
		p.s = enc[p.s];
		if (p.f < p.s) swap(p.f, p.s);
		adj[p.f].push_back(p.s);
	}
	V<int> cur(n, -1);
	using bs = bitset<450>;
	ll tot = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < sz(adj[i]); j++) {
			cur[adj[i][j]] = j;
		}
		V<bs> work(sz(cur));
		for (int x : adj[i]) {
			for (int y : adj[x]) {
				if (cur[y] != -1) {
					tot += (work[cur[x]]&work[cur[y]]).count();
					work[cur[x]][cur[y]] = work[cur[y]][cur[x]] = 1;
				}
			}
		}
		for (int j : adj[i]) cur[j] = -1;
	}
	cout << tot << "\n";
	return 0;
}