#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
int const maxn = 1e5 + 5, K = 500;
vector < int > g[maxn], G[maxn];
unordered_set < int > in[maxn];
int pos[maxn];
bitset < K > go[K];

inline string sum(string a, string b) {
    string res = "";
    int ok = 0;
    for (int i = 0; i < max(a.size(), b.size()); i++) {
        if (i < a.size()) ok += (a[a.size() - i - 1] - '0');
        if (i < b.size()) ok += (b[b.size() - i - 1] - '0');
        res += char('0' + ok % 10);
        ok /= 10;
    }
    if (ok) res += "1";
    reverse(res.begin(), res.end());
    return res;
}

main() {
#ifdef HOME
    freopen("input.txt", "r", stdin);
#endif // HOME
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m, u, v;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vector < int > node;
    for (int i = 1; i <= n; i++) node.push_back(i);
    sort(node.begin(), node.end(), [](int u, int v) {
        return g[u].size() < g[v].size();
    });
    for (int i = 0; i < n; i++) pos[node[i]] = i;
    for (int i = 1; i <= n; i++) {
        for (auto to : g[i]) {
            if (pos[i] < pos[to]) G[i].push_back(to), in[i].insert(to);
        }
    }
    string ans = "0";
    for (int i = 0; i < n; i++) {
        int cur = node[i];
        assert(G[i].size() < K);
        for (int j = 0; j < G[i].size(); j++) go[j] = 0;
        sort(G[cur].begin(), G[cur].end(), [](int u, int v) {
            return pos[u] < pos[v];
        });
        vector < pair < int, int > > edges;
        for (int j = 0; j < G[cur].size(); j++) {
            for (int z = j + 1; z < G[cur].size(); z++) {
                if (in[G[cur][j]].find(G[cur][z]) != in[G[cur][j]].end()) {
                    go[j][z] = 1;
                    go[z][j] = 1;
                    edges.push_back({j, z});
                }
            }
        }
        ll add = 0;
        for (auto [u, v] : edges) {
            add += (go[u]&go[v]).count();
        }
        add /= 3;
        if (add) ans = sum(ans, to_string(add));
        //cout << cur << " " << ans << endl;
    }
    cout << ans << '\n';
    return 0;
}