#include<bits/stdc++.h>
#define N 100010
#define ull unsigned long long
#define For(i,a,b) for(register int i=a;i<=b;i++)
#define pc __builtin_popcountll
using namespace std;
int n,m,d[N],rnk[N];
long long ans;
struct E{int x,y;}nw[N*400];
vector<int> go[N],e[N];
struct my_bitset
{
    int sz;ull v[10];
    inline void ins(int x){v[x/64]|=1ull<<(x%64);}
    inline void init(int nsz)
    {
        sz=(nsz-1)/64;
        For(i,0,sz) v[i]=0;
    }
    inline int cnt()
    {
        int res=0;
        For(i,0,sz) res+=pc(v[i]);
        return res;
    }
    inline my_bitset operator &(const my_bitset &p)const
    {
        my_bitset res;res.sz=sz;
        For(i,0,sz) res.v[i]=v[i]&p.v[i];
        return res;
    }
}bs[1010];

inline int read()
{
    register int x=0,c=getchar();
    while(!isdigit(c)) c=getchar();
    while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
    return x;
}

int main()
{
    n=read(),m=read();
    For(i,1,m)
    {
        int x=read(),y=read();
        d[x]++,go[x].push_back(y);
        d[y]++,go[y].push_back(x);
    }
    For(i,1,n) for(int to:go[i])
        if(d[i] < d[to] || d[i] == d[to] && i < to)
            e[i].push_back(to);
    For(i,1,n)
    {
        int cnt=0,sz=e[i].size();rnk[0]=0;
        for(int to:e[i]) rnk[to]=++rnk[0],bs[rnk[0]].init(sz);
        for(int to:e[i]) for(int v:e[to])
            if(rnk[to]) bs[rnk[to]].ins(rnk[v]-1),nw[++cnt]=(E){to,v};
        For(j,1,cnt)
        {
            int a=nw[j].x,b=nw[j].y;
            ans+=(bs[rnk[a]]&bs[rnk[b]]).cnt();
        }for(int to:e[i]) rnk[to]=0;
    }printf("%lld\n",ans);
    return 0;
}
/*
5 9
1 2
1 3
1 4
1 5
2 3
2 4
2 5
3 4
3 5
*/