#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<cstdlib>
#include<algorithm>
using namespace std;
int n,m,p[100000],f[20][20],ans;
int main()
{
	freopen("tria.in","r",stdin);
    freopen("tria.out","w",stdout);
	cin>>n>>m;
	p[1]=p[2]=0;p[3]=1;
	for(int i=4;i<=n;i++)p[i]=p[i-1]+i*(i+1)/2;
	if(m==0)
	{
		cout<<4*p[n];
	}
	else if(n<10){
		for(int i=1;i<=m;i++)
		{int  che,a,b,w,y;
			cin>>che>>a>>b;
			if(che==1){if(a>b)f[a][b]=1;else f[b][a]=1;}else {if(a>b)f[a][b]=-1;else f[b][a]=-1;}}
			for(int j=1;j<=n;j++)
			   for(int k=j+1;k<=n;k++)
			     for(int l=k+1;l<=n;l++)
		   if(j!=k&&k!=l&&l!=j){
			   	if(f[j][k]!=-1&&f[j][l]==-1&&f[k][l]==-1)ans++;
			   	if(f[j][l]!=-1&&f[j][k]==-1&&f[k][l]==-1)ans++;
			   	if(f[k][l]!=-1&&f[j][l]==-1&&f[j][k]==-1)ans++;
			   	if(f[j][l]==1&&f[k][l]==1&&f[j][k]!=1)ans++;
			   	if(f[j][k]==1&&f[k][l]==1&&f[j][l]!=1)ans++;
			   	if(f[j][l]==0&&f[j][k]==0&&f[k][l]==0&&f[l][j]==0&&f[k][j]==0&&f[l][k]==0)ans+=4;
			   }
			for(int i=1;i<=n;i++)
			{
				for(int j=1;j<n;j++)cout<<f[i][j];
				cout<<f[i][n]<<endl;
			   }   
			cout<<ans;
			return 0;   
		}
	else cout<<0;	
	return 0;	
	}