#include <bits/stdc++.h>
using namespace std;
ifstream f("triplete.in");
ofstream g("triplete.out");
const int nMax = 4099;
bitset <nMax> a[nMax];
int main()
{
    int n , m, x, y;
    f>> n >> m;
    for(int i = 1; i <= m; i++) {
        f>> x >> y;
        if(x > y) {
            swap(x,y);
        }
        a[x][y] = 1;
    }
    int sol = 0;
    for(int i = 1; i <= n - 2; i++) {
        for(int j = i + 1; j <= n - 1; j++) {
            sol += (a[i] & a[j]).count();
        }
    }
    g<< sol << "\n";
    return 0;
}