#include<cstdio>
#include<vector>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int m,n;
vector<int>p[100010];
bool vis[100100];
bool pan1()
{
	for (int i=1;i<=n;i++)
	{
		for (int j=0;j<p[i].size();j++)
		{
			int k=p[i][j];
			for (int l=0;l<p[k].size();l++)
			if (p[k][l]==i) return false;
		}
	}
	return true;
}
void dfs(int i)
{
	vis[i]=true;
	for (int k=0;k<p[i].size();k++)
	 if (!vis[p[i][k]])
	  dfs(p[i][k]);
}
bool pan2()
{
    memset(vis,0,sizeof(vis));
	dfs(1);
	for (int i=1;i<=n;i++)
	 if (!vis[i]) return false;
	return true;
}
int main()
{
	freopen("tria.in","r",stdin);
	freopen("tria.out","w",stdout);
	cin>>n>>m;
	int ans=0;
	if (n==3) cout<<4;
	else 
	{
	for (int k=1;k<=n;k++)
	{
		for (int i=1;i<=n;i++)
		 p[i].clear();
    	for (int i=1;i<=n;i++)
     	for (int j=1;j<=n;j++)
    	{
            p[i].push_back(j);
            p[j].push_back(i);
            if (pan1()&&pan2())
             ans++;
		}
	}
	}
	cout<<ans;
	return 0;
}