#include <bits/stdc++.h>
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define rep(i, a, b) for (int i = (a), I = (b); i <= I; ++i)
#define per(i, a, b) for (int i = (a), I = (b); i >= I; --i)
using i64 = long long;
using pii = pair<int, int>;
template<typename T> void up(T &x, T y) { if (x < y) x = y; }
template<typename T> void down(T &x, T y) { if (x > y) x = y; }

const int N = 100005, B = 64 * 7;
int n, m, d[N], x[N], y[N], ord[N], id[N], pot[B];
vector<int> e[N];
bitset<B> g[B];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    cin >> n >> m;
    rep(i, 1, m) cin >> x[i] >> y[i], ++d[x[i]], ++d[y[i]];

    iota(ord + 1, ord + n + 1, 1);
    sort(ord + 1, ord + n + 1, [&](int i, int j) {
        return pii(d[i], i) < pii(d[j], j);
    });
    rep(i, 1, m) {
        if (pii(d[x[i]], x[i]) > pii(d[y[i]], y[i])) swap(x[i], y[i]);
        e[x[i]].push_back(y[i]);
    }

    i64 ans = 0;
    rep(o, 1, n) {
        int u = ord[o];
        int cnt = 0;
        for (auto v : e[u]) id[v] = ++cnt, pot[cnt] = v;
        rep(i, 1, cnt) {
            g[i].reset();
            int u = pot[i];
            for (auto v : e[u]) if (id[v]) g[i].set(id[v]);
        }
        rep(i, 1, cnt) rep(j, i + 1, cnt) if (g[i][j]) ans += (g[i] & g[j]).count();
        for (auto v : e[u]) id[v] = 0;
    }
    cout << ans << "\n";

    return 0;
}