1
#include <bits/stdc++.h>
2

3
#define N 100010
4
using namespace std;
5

6
struct Edge {
7
    int to, ne;
8
} edges[N << 1];
9

10
int h[N], idx = 0;
11
int deg[N << 1];
12
bool st[N << 1];
13
int u[N << 1], v[N << 1];
14

15
void add(int a, int b) {
16
    idx++;
17
    edges[idx].to = b;
18
    edges[idx].ne = h[a];
19
    h[a] = idx;
20
}
21

22
int main() {
23
    ios::sync_with_stdio(false);
24
    cin.tie(nullptr);
25
    cout.tie(nullptr);
26

27
    memset(h, -1, sizeof h);
28
    int n, m;
29
    cin >> n >> m;
30
    for (int i = 1; i <= m; i++) {
31
        cin >> u[i] >> v[i];
32
        deg[u[i]]++;
33
        deg[v[i]]++;
34
    }
35
    for (int i = 1; i <= m; i++) {
36
        if ((deg[u[i]] == deg[v[i]] && u[i] > v[i]) || deg[u[i]] > deg[v[i]]) swap(u[i], v[i]);
37
        add(u[i], v[i]);
38
    }
39
    int cnt = 0;
40
    for (int u = 1; u <= n; u++) {
41
        for (int i = h[u]; ~i; i = edges[i].ne) {
42
            int j = edges[i].to;
43
            st[j] = true;
44
        }
45
        for (int i = h[u]; ~i; i = edges[i].ne) {
46
            int v = edges[i].to;
47
            for (int j = h[v]; ~j; j = edges[j].ne) {
48
                int w = edges[j].to;
49
                if (st[w]) cnt++;
50
            }
51
        }
52
        for (int i = h[u]; ~i; i = edges[i].ne) {
53
            int j = edges[i].to;
54
            st[j] = false;
55
        }
56
    }
57
    cout << cnt << endl;
58
    return 0;
59
}