#include "bits/stdc++.h" using namespace std; #define int long long #define REP(i, n) for (int i = 0; i < (int)n; ++i) #define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i) #define FOR(i, s, n) for (int i = s; i < (int)n; ++i) #define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i) #define ALL(a) a.begin(), a.end() #define IN(a, x, b) (a <= x && x < b) templateistream&operator >>(istream&is,vector&vec){for(T&x:vec)is>>x;return is;} templateinline void out(T t){cout << t << "\n";} templateinline void out(T t,Ts... ts){cout << t << " ";out(ts...);} templateinline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;} templateinline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;} constexpr int INF = 1e18; vectormp(string s) { vectorret(s.size() + 1); ret[0] = -1; int j = -1; for(int i = 0; i < s.size(); i++) { while(j >= 0 && s[i] != s[j]) j = ret[j]; ++j; ret[i + 1] = j; } return ret; } signed main(){ int N, M; cin >> N >> M; vector>a(N, vector(N)); REP(i, M) { int b, c; cin >> b >> c; --b; --c; a[b][c] = a[c][b] = true; } int ans = 0; auto same = [&](int i, int j) { int ret = 0; REP(k, N) { if(k == i || k == j) continue; ret |= a[i][k] && a[k][j]; } return ret; }; auto good = [&](int i, int j) { return a[i][j] || !same(i, j); }; REP(i, N) { FOR(j, i + 1, N) { FOR(k, j + 1, N) { if(good(i, j) && good(j, k) && good(k, i)) ++ans; } } } out(ans); }