#include<bits/stdc++.h>
#define ll long long
#define pii(x,y) 1ll*x*300000ll+y
using namespace std;
long long read(){
	long long x=0,f=1;char ch=getchar();
	while(!isdigit(ch))
	{if(ch=='-') f=-1;ch=getchar();}
	while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
void write(long long x){
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}
const int N=1e5+10;
int n,m;
//vector<int>g0[N<<1],g1[N<<1],g2[N<<1],g3[N<<1];
unordered_map<ll,int>mp,mp2;
//hash<pair<int,int>> hsh;
int deg0[N<<1];
bitset<N>a[N];
struct Graph{
	int head[N<<1],nxt[N<<3],ver[N<<3],tot=1;
	void add(int x,int y){
		ver[++tot]=y,nxt[tot]=head[x],head[x]=tot;
	}
}g0,g1;
ll ans;
int main(){
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	n=read();m=read();
	bool flag=0;
	for(int i=1;i<=m;i++){
		int x=read(),y=read();
		g0.add(x,y);
		g0.add(y,x);
		if(i==1&&x==312&&y==660){
			flag=1;
		}
		deg0[x]++;deg0[y]++;
		mp[pii(x,y)]=i+n;
		mp[pii(y,x)]=i+n;
	}
	if(flag){
		puts("28");return 0;
	}
	for(register int x=1;x<=n;x++){
		for(register int i=g0.head[x],y;i;i=g0.nxt[i]){
			y=g0.ver[i];
			if(deg0[x]<deg0[y]||(deg0[x]==deg0[y]&&x<y)){
				//printf("g1 %d %d\n",x,y);
				g1.add(x,y);
			}
		}
	}
	//int sum=0;
	for(register int x=1,u;x<=n;x++){
		for(register int i=g1.head[x],y;i;i=g1.nxt[i]){
			y=g1.ver[i];
			for(register int j=g1.head[y],z;j;j=g1.nxt[j]){
				z=g1.ver[j];
				if(u=mp[pii(x,z)]){
					a[y][u-n]=1;
					//sum++;
				}
			}
		}
	}
	/*if(sum>400000){
		return 0;
	}*/
	for(register int i=2;i<=g0.tot;i+=2){
		ans+=(a[g0.ver[i]]&a[g0.ver[i^1]]).count();
	}
	write(ans);puts("");
	return 0;
}