/*
[templates]: 
duipai
spjdp
compre
addhis
floor_sum
treedfs
matrix
network_flow
polynomial
lca
bitset
valuesgt
fenwick
erbitree
*/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
#include<bits/stdc++.h>
using namespace std;
#define int long long
//use ll instead of int.
#define f(i, a, b) for(int i = (a); i <= (b); i++)
#define cl(i, n) i.clear(),i.resize(n);
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 1e18;
//#define cerr if(false)cerr
//#define freopen if(false)freopen
mt19937 rng(time(0)); 
int rnd(int l, int r) {return rng() % (r-l+1) + l; }
#define watch(x) cerr  << (#x) << ' '<<'i'<<'s'<<' ' << x << endl
void pofe(int number, int bitnum) {
    string s; f(i, 0, bitnum) {s += char(number & 1) + '0'; number >>= 1; } 
    reverse(s.begin(), s.end()); cerr << s << endl; 
    return;
}
template <typename TYP> void cmax(TYP &x, TYP y) {if(x < y) x = y;}
template <typename TYP> void cmin(TYP &x, TYP y) {if(x > y) x = y;}
//调不出来给我对拍！
//use std::array.
const int N = 100000, sq = sqrt(2 * N); 
vector<int> edge[N + 10], rgt[N + 10]; int deg[N + 10]; int rnk[N + 10]; pii e[N + 10]; 
bool can[N + 10]; int rernk[N + 10]; pii ree[N + 10]; bitset<sq + 5> bs[sq + 5]; 
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen();
    //freopen();
    //time_t start = clock();
    //think twice,code once.
    //think once,debug forever.
    int n, m; cin >> n >> m; 
    f(i, 1, m) {
        int u, v; cin >> u >> v; deg[u] ++; deg[v] ++; e[i] = {u, v}; 
    }
    vector<pii> vec; 
    f(i, 1, n) vec.push_back({deg[i], i});
    sort(vec.begin(), vec.end()); 
    f(i, 0, n - 1) rnk[vec[i].second] = i + 1; 
    f(i, 1, m) {
        int u = rnk[e[i].first], v = rnk[e[i].second]; 
        // cerr << "First Relabel: edge: " << u << " " << v << endl; 
        edge[u].push_back(v); edge[v].push_back(u); 
        if(u > v) swap(u, v); 
        rgt[u].push_back(v); 
    }
    int ans = 0; 
    f(i, 1, n) {
        int cnt = 0; 
        for(int j : rgt[i]) rernk[j] = ++cnt; 
        for(int j : rgt[i]) {
            for(int k : rgt[j]) {
                if(rernk[k]) {
                    ree[++ cnt] = {rernk[j], rernk[k]}; 
                    bs[rernk[j]][rernk[k]] = bs[rernk[k]][rernk[j]] = 1; 
                }
            }
        }
        int tmp = 0; 
        f(j, 1, cnt) {
            int x = ree[j].first, y = ree[j].second; 
            tmp += (bs[x] & bs[y]).count(); 
        }
        ans += tmp / 3; 
        f(j, 1, cnt) bs[j].reset(); 
        for(int j : rgt[i]) rernk[j] = 0; 
    }
    cout << ans << endl; 
    //time_t finish = clock();
    //cout << "time used:" << (finish-start) * 1.0 / CLOCKS_PER_SEC <<"s"<< endl;
    return 0;
}