#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<ctime>
using namespace std;
const int mo=998244353,maxn=5000;
int mapp[maxn][maxn];
int n,m,ans=0;
void init()
{
	memset(mapp,-1,sizeof(mapp));
	int f,x,y;
	for (int i=1;i<=m;i++) {
		scanf("%d%d%d",&f,&x,&y);
		if (f)mapp[x][y]=mapp[y][x]=1;
		else mapp[x][y]=mapp[y][x]=0;
	}
}
void work()
{
	for (int i=1;i<=n;i++){
		for (int j=i+1;j<=n;j++) {
			if (!mapp[i][j]) {
				//for (int k=j+1;k<=n;k++)
					//if (mapp[i][j]==)
			}
		}
		
	}
}
int main()
{
	freopen("tria.in","r",stdin);
	freopen("tria.out","w",stdout);
	cin>>n>>m;
	printf("0\n");
	return 0;
	if (!m)
	{
		
	}
	init();
	work();
	return 0;
}