#include<bits/stdc++.h>
using namespace std;
int n,m;
const int B=450,N=2e5+10;
bitset<B>a[B];
int U[N],V[N];
#define pb push_back
int is[N],rk[N],d[N],be[N];
vector<int>g[N];
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)be[i]=i;
    for(int i=1;i<=m;i++)
    scanf("%d%d",&U[i],&V[i]),d[U[i]]++,d[V[i]]++;
    sort(be+1,be+n+1,[&](int x,int y){if(d[x]!=d[y])return d[x]<d[y];return x<y;});
    for(int i=1;i<=n;i++)rk[be[i]]=i;
    for(int i=1;i<=m;i++){
        if(rk[U[i]]>rk[V[i]])swap(U[i],V[i]);
        g[U[i]].pb(V[i]);
    }
    long long ans=0;
    for(int i=1;i<=n;i++){
        int o=0;
        for(int v:g[i])is[v]=++o;
        for(int j=1;j<=o;j++)a[j].reset();
        for(int v:g[i])for(int w:g[v])if(is[w])a[is[v]][is[w]]=a[is[w]][is[v]]=1;
        for(int v:g[i])for(int w:g[v])if(is[w])ans+=(a[is[v]]&a[is[w]]).count();
        for(int v:g[i])is[v]=0;
    }
    printf("%lld",ans/2);
    return 0;
}