#include<bits/stdc++.h>
using namespace std;
int n,m;
int g[105][105];
int main()
{
	scanf("%d%d",&n,&m);
	
	memset(g,0x3f,sizeof(g));
	for (int i=1;i<=n;i++)
	{
		g[i][i]=0;
	}
	
	for (int i=1;i<=m;i++)
	{
		int a,b,c;
		scanf("%d%d%d",&a,&b,&c);
		g[a][b]=min(g[a][b],c);
		g[b][a]=min(g[b][a],c);
	}
	
	for (int k=1;k<=n;k++)
		for (int i=1;i<=n;i++)
			for (int j=1;j<=n;j++)
				if (g[i][j]>g[i][k]+g[k][j])
				{
					g[i][j]=g[i][k]+g[k][i];
					g[j][i]=g[i][k]+g[k][i];
				}
				
	for (int i=1;i<=n;i++)
	{
		for (int j=1;j<=n;j++)
		{
			printf("%d ",g[i][j]);
		}printf("\n");
	}
	
	return 0;
}

RECORD:link