#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#pragma GCC target("avx,avx2,sse,sse2")
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
#include <bits/extc++.h> /** keep-include */
// To use most bits rather than just the lowest ones:
struct chash { // large odd number for C
	const uint64_t C = ll(4e18 * acos(0)) | 71;
	ll operator()(ll x) const { return __builtin_bswap64(x*C); }
};

int main() {
	cin.tie(0)->sync_with_stdio(0);
    mt19937 rng(32);
    int n, m;
    cin >> n >> m;

    vector<int> perm(n); iota(all(perm), 0); shuffle(all(perm), rng);

    vector<vector<int>> g(n);
    vector uh(n, __gnu_pbds::gp_hash_table<ll,int,chash>({},{},{},{},{1<<16}));
    vector<array<int, 2>> edges(m);
    for(auto &[u, v] : edges) {
        cin >> u >> v;
        --u, --v;
        u = perm[u], v= perm[v];
        g[u].push_back(v);
        g[v].push_back(u);
        uh[u][v] = uh[v][u] = 1;
    }
    vector<uint64_t> bt(n);
    ll ans = 0;
    for(int s = 0; s < m; s += 64) {
        int e = min(s + 64, m);
        fill(all(bt), 0);
        
        for(int i = s; i < e; i++) {
            auto [u, v] = edges[i];
            if(g[u].size() > g[v].size()) swap(u, v);
            for(auto w : g[u]) {
                if(uh[v][w]) {
                    bt[w] |= 1ull<<(i&63);
                }
            }
        }

        for(auto [u, v] : edges) {
            ans += __builtin_popcountll(bt[u] & bt[v]);
        }
    }
    cout << ans / 6 << '\n';
}