#include <cstdio>
#include <queue>
#include <vector>
#include <bitset>
#include <functional>
#include <algorithm>
#define pb push_back
#define ull unsigned long long
using std::bitset;
using std::vector;
using std::priority_queue;
const int N=100005;
int n, m, deg[N], id[N], top;
ull bs[N/8][N/8/64+5], ans;
bitset<N> rs[N];
vector<int> e[N], f[N], g[N];
inline void set(ull *a, int x)
{
	a[x>>8]|=(1ull<<(x&63));
}
inline int ask(ull *a, ull *b, int lim)
{
	int ret=0;
	for(int i=0; i<=lim; ++i) ret+=__builtin_popcountll(a[i]&b[i]);
	return ret;
}
int main()
{
	scanf("%d%d", &n, &m);
	for(int i=1, x, y; i<=m; ++i) scanf("%d%d", &x, &y), e[x].pb(y), rs[x].set(y), rs[y].set(x), ++deg[x], ++deg[y];
	for(int i=1; i<=n; ++i) for(int x:e[i])
	{
		if(deg[x]<deg[i]) f[x].pb(i), g[i].pb(x);
		else f[i].pb(x), g[x].pb(i);
	}
	for(int u=1; u<=n; ++u)
	{
		top=0;
		for(int v:f[u]) id[v]=++top;
		if(top*8<=m)
		{
			int lim=((top)>>8)+2;
			for(int i=1; i<=top+1; ++i) std::fill(bs[i], bs[i]+lim+1, 0);
			for(int a:f[u]) for(int b:f[u]) if(rs[a][b]) set(bs[id[a]], id[b]);
			for(int v:g[u])
			{
				std::fill(bs[top+1], bs[top+1]+lim+1, 0);
				for(int x:f[u]) if(rs[v][x])
				{
					int t=ask(bs[id[x]], bs[top+1], lim);
					// printf("%d %d %d %d\n", u, v, x, t);
					ans+=t;
					set(bs[top+1], id[x]);
				}
			}
		}
		else
		{
			for(int v:g[u])
			{
				rs[n+1].reset();
				for(int x:f[u]) if(rs[v][x])
				{
					int t=(rs[x]&rs[n+1]).count();
					// printf("f %d %d %d %d\n", u, v, x, t);
					ans+=t;
					rs[n+1].set(x);
				}
			}
		}
	}
	printf("%llu\n", ans);
	return 0;
}