#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream fin("triplete.in");
ofstream fout("triplete.out");

const int NMax = 4100;

vector < int > v[NMax];

inline bool binarySearch(const int &L, const int &val){
    int mid;
    int lo = 0;
    int hi = v[L].size() - 1;
    while(lo <= hi){
        mid = (lo + hi) / 2;
        if(v[L][mid] == val){
            return 1;
        } else {
            if(v[L][mid] < val){
                lo = mid + 1;
            } else {
                hi = mid - 1;
            }
        }
    }
    return 0;
}

int main()
{
    int n, m, x, y, ans = 0;
    fin >> n >> m;
    for(int i = 1; i <= m; i++){
        fin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(int i = 1; i <= n; i++){
        sort(v[i].begin(), v[i].end());
    }
    for(int i = 1; i <= n; i++){
        for(int j = 0; j < v[i].size(); j++){
            for(int k = j + 1; k < v[i].size(); k++){
                if(binarySearch(v[i][j], v[i][k])){
                    ans++;
                }
            }
        }
    }
    fout << ans / 3;
    return 0;
}