#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

namespace count_graphs {

std::vector<std::tuple<int, int, int>> enumerate_C4(const std::vector<std::vector<int>>& G) {
    int n = G.size();
    std::vector<int> deg(n);
    for (int i = 0; i < n; i++) deg[i] = G[i].size();
    auto comp = [&](int u, int v) -> bool { return deg[u] != deg[v] ? deg[u] < deg[v] : u < v; };
    std::vector<std::vector<int>> H(n);
    for (int i = 0; i < n; i++) {
        for (const int& j : G[i]) {
            if (comp(i, j)) {
                H[i].emplace_back(j);
            }
        }
    }
    std::vector<bool> f(n, false);
    std::vector<std::tuple<int, int, int>> res;
    for (int i = 0; i < n; i++) {
        for (int& j : H[i]) f[j] = true;
        for (int& j : H[i]) {
            for (int& k : H[j]) {
                if (f[k]) {
                    res.emplace_back(i, j, k);
                }
            }
        }
        for (int& j : H[i]) f[j] = false;
    }
    return res;
}

long long count_C4(const std::vector<std::vector<int>>& G) {
    int n = G.size();
    std::vector<int> deg(n);
    for (int i = 0; i < n; i++) deg[i] = G[i].size();
    auto comp = [&](int u, int v) -> bool { return deg[u] != deg[v] ? deg[u] < deg[v] : u < v; };
    std::vector<std::vector<int>> H(n);
    for (int i = 0; i < n; i++) {
        for (const int& j : G[i]) {
            if (comp(i, j)) {
                H[i].emplace_back(j);
            }
        }
    }
    std::vector<int> f(n, 0);
    long long res = 0;
    for (int i = 0; i < n; i++) {
        for (const int& j : G[i]) {
            for (const int& k : H[j]) {
                if (comp(i, k)) {
                    res += f[k];
                    f[k]++;
                }
            }
        }
        for (const int& j : G[i]) {
            for (const int& k : H[j]) {
                f[k] = 0;
            }
        }
    }
    return res;
}

long long count_K4(const std::vector<std::vector<int>>& G) {
    int n = G.size();
    std::vector<int> deg(n);
    for (int i = 0; i < n; i++) deg[i] = G[i].size();
    auto comp = [&](int u, int v) -> bool { return deg[u] != deg[v] ? deg[u] < deg[v] : u < v; };
    std::vector<std::vector<int>> H(n);
    for (int i = 0; i < n; i++) {
        for (const int& j : G[i]) {
            if (comp(i, j)) {
                H[i].emplace_back(j);
            }
        }
    }
    long long res = 0;
    std::vector<int> idx(n, -1);
    constexpr int B = 64;
    for (int i = 0; i < n; i++) {
        int len = H[i].size();
        for (int j = 0; j < len; j++) idx[H[i][j]] = j;
        std::vector<std::vector<int>> I(len);
        for (int j = 0; j < len; j++) {
            for (int& u : H[H[i][j]]) {
                if (idx[u] == -1) continue;
                I[j].emplace_back(idx[u]);
            }
        }
        for (int b = 0; b < (len + B - 1) / B; b++) {
            int L = B * b, R = std::min(len, L + B);
            std::vector<unsigned long long> adj(len, 0);
            for (int j = L; j < R; j++) {
                for (const int& k : I[j]) {
                    adj[k] |= 1ULL << (j - L);
                }
            }
            for (int j = 0; j < len; j++) {
                for (const int& k : I[j]) {
                    res += __builtin_popcountll(adj[j] & adj[k]);
                }
            }
        }
        for (int j = 0; j < len; j++) idx[H[i][j]] = -1;
    }
    return res;
}

}  // namespace count_graphs

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    cin >> n >> m;
    vector<vector<int>> G(n);
    for (; m--;) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }

    auto ans = count_graphs::count_K4(G);
    cout << ans << '\n';
    return 0;
}