//#pragma GCC optimize(2)
#include<algorithm>
#include<stdlib.h>
#include<iostream>
#include<cassert>
#include<cstring>
#include<cstdlib>
#include<iomanip>
#include<vector>
#include<cstdio>
#include<random>
#include<bitset>
#include<queue>
#include<cmath>
#include<set>
#include<map>
//#include<bits/stdc++.h>
#define uint unsigned int
#define int long long
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define lll __int128
#define db double
#define ld long double
#define pii pair<int,int>
#define For(i,l,r) for(int i=(l);i<=(r);++i)
#define rof(i,r,l) for(int i=(r);i>=(l);--i)
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
#define lowbit(t) (t&-t)
#define ckmax(a,b) a=max(a,b)
#define ckmin(a,b) a=min(a,b)
#define ppct(t) __builtin_popcount(t)
//#define x1 xxx111
//#define y1 yyy111
//#define x2 xxx222
//#define y2 yyy222
using namespace std;
const int N=1e5+10,inf=1e18,mod=1e9+7;
int deg[N];
vector<int>e1[N];
int vis[N];
int triangle(vector<pii>vec,int n){
    int ans=0;
    For(i,1,n){
        deg[i]=0;
        e1[i].clear();
    }
    for(auto [u,v]:vec){++deg[u];++deg[v];}
    for(auto [u,v]:vec){
        if(deg[u]<deg[v]||(deg[u]==deg[v]&&u<v))
            e1[u].push_back(v);
        else
            e1[v].push_back(u);
    }
    For(x,1,n){
        for(auto y:e1[x])vis[y]=x;
        for(auto y:e1[x])for(auto z:e1[y]){
            if(vis[z]==x)++ans;
        }
    }
    return ans;
}
int n,m;
int du[N];
vector<int>e[N];
int u[N],v[N];
vector<pii>vec;
int id[N];
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>n>>m;
    For(i,1,m){
        cin>>u[i]>>v[i];
        ++du[u[i]];
        ++du[v[i]];
    }
    For(i,1,m){
        if(du[u[i]]<du[v[i]]||(du[u[i]]==du[v[i]]&&u[i]<v[i]))
            e[u[i]].push_back(v[i]);
        else
            e[v[i]].push_back(u[i]);
    }
    int ans=0;
    For(i,1,n){
        int tot=0;
        for(auto x:e[i])id[x]=++tot;
        vec.clear();
        for(auto x:e[i])
            for(auto y:e[x])
                if(id[y])
                    vec.push_back({id[x],id[y]});
        ans+=triangle(vec,e[i].size());
        for(auto x:e[i])id[x]=0;
    }
    cout<<ans<<endl;
    return 0;
}
/*
 5 9
 1 2
 1 3
 1 4
 1 5
 2 3
 2 4
 2 5
 3 4
 3 5
 */