#include<bits/stdc++.h>
using namespace std;
const int maxn=400+10,maxm=1e5+10;
int n,m,x[maxm],y[maxm];
bool ok[maxn],S[maxn][maxn];
bool check(int i,int j)
{
	for (int k=1;k<=n;k++)
	    if (S[i][k]&&S[j][k])
	        return 0;
	return 1;
}
int main()
{
	cin>>n>>m;
	for (int i=1;i<=m;i++) scanf("%d%d",&x[i],&y[i]);
	for (int i=1;i<=n;i++)
	{
	    ok[i]=1;
	    S[i][i]=1;
		for (int j=m;j>=1;j--)
		{
		    if (S[i][x[j]]&&S[i][y[j]])
		    {
		    	ok[i]=0;break;
			}
			if (S[i][x[j]]&&!S[i][y[j]])
			    S[i][y[j]]=1;
			if (!S[i][x[j]]&&S[i][y[j]])
			    S[i][x[j]]=1;
		}
	}
	int ans=0;
	for (int i=1;i<=n;i++)
	    for (int j=i+1;j<=n;j++)
	        if (ok[i]&&ok[j]&&check(i,j))
	            ans++;
	cout<<ans;
	return 0;
}