#pragma GCC optimize("Ofast")

#pragma GCC target("popcnt")

#include <bits/stdc++.h>
using namespace std;

#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
template <typename ...T>
void debug_(const char *s, T ...a) {
    cerr << "\e[1;32m( " << s << " ) = ( ";
    int cnt = sizeof...(T);
    (..., (cerr << a << (--cnt ? ", " : " )\e[0m\n")));
}
template <typename I>
void orange_(const char *s, I L, I R) {
    cerr << "\e[1;32m[ " << s << " ] = [ ";
    for (int f = 0; L != R; ++L)
        cerr << (f++ ? ", " : "") << *L;
    cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(a...) safe
#define orange(a...) safe
#endif

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n, m; cin >> n >> m;
    vector<int> d(n);
    vector<pair<int, int>> e(m);
    // unordered_set<pair<int, int>, h> s;

    vector<pair<int,int>> so;
    for (auto &[u, v] : e) {
        cin >> u >> v;
        --u, --v;
        d[u]++, d[v]++;
        // s.insert(minmax(u, v));
        so.push_back(minmax(u, v));
    }
    sort(so.begin(), so.end());

    vector<vector<int>> g(n);
    for (auto [u, v] : e) {
        if (d[u] > d[v]) swap(u, v);
        g[u].push_back(v);
    }

    const int maxc = 512;
    auto gao = [&](auto e, int n) {
        vector<bitset<maxc>> B(n);
        for (auto [u, v]: e)
            B[u][v] = B[v][u] = true;
        int ans = 0;
        for (auto [u, v]: e) {
            ans += (B[u] & B[v]).count();
        }
        ans /= 3;
        return ans;
    };

    int ans = 0;
    vector<int> idx(n, -1);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < g[i].size(); ++j) idx[g[i][j]] = j;

        vector<pair<int, int>> ng;
        for (int j = 0; j < g[i].size(); ++j) {
            for (int w: g[g[i][j]]) {
                if (idx[w] != -1) {
                    ng.emplace_back(idx[w], j);
                }
            }
        }
        ans += gao(ng, g[i].size());

        for (int u: g[i]) idx[u] = -1;
    }
    cout << ans << '\n';
    return 0;
}