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

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); }

const int MAX_N = 100010;

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

    vector<vector<int>> G(n);
    for (auto [u, v] : es) {
        if (deg[u] < deg[v] or (deg[u] == deg[v] and u < v))
            G[u].emplace_back(v);
        else
            G[v].emplace_back(u);
    }
    ll ans = 0;
    vector<bitset<MAX_N>> bs(n);
    for (int i = 0; i < n; i++) {
        sort(G[i].begin(), G[i].end());
        for (int& j : G[i]) bs[i][j] = 1;
    }
    for (int u = 0; u < n; u++) {
        for (int& v : G[u]) {
            bs[v].reset();
            vector<int> W;
            for (int i = 0, j = 0; i < int(G[u].size()) and j < int(G[v].size());) {
                if (G[u][i] == G[v][j]) {
                    int w = G[u][i];
                    bs[v][w] = 1;
                    W.emplace_back(w);
                    i++, j++;
                } else if (G[u][i] < G[v][j])
                    i++;
                else
                    j++;
            }
            for (int& w : W) ans += (bs[v] & bs[w]).count();
        }
    }

    cout << ans << '\n';
    return 0;
}