#include<bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int deg[N];

vector<int> G[N];
typedef pair<int, int> pii;
bitset<400> to[N];
int id[N];

int main() {
    ios::sync_with_stdio(false);

    int n, m;
    cin >> n >> m;
    vector<pii> e;
    for (int i = 1; i <= m; i++) {
        int u, v;
        cin >> u >> v;
        e.push_back({u, v});
        deg[u]++, deg[v]++;
    }

    for (auto [u, v]: e) {
        if (deg[u] > deg[v] || (deg[u] == deg[v] && u > v)) swap(u, v);
        G[u].push_back(v);
    }

    long long ans = 0;
    for (int i = 1; i <= n; i++) {
        int cnt = 1;
        memset(id,0,sizeof(id));
        for (int v: G[i]) {
            id[v] = (cnt++);
            to[v].reset();
        }
        for (int v: G[i]) {
            for (int p: G[v]) {
                if (id[p]) {
                    to[v][id[p]] = 1;
                }
            }
        }

        for (int v: G[i]) {
            for (int p: G[v]) {
                ans += (to[v] & to[p]).count();
            }
        }
    }

    cout << ans ;

}