#include<iostream>
#include <iomanip>
using namespace std;
int main()
{
	//最短路径之Floyd算法
	//https://www.cnblogs.com/GumpYan/p/5540549.html

	int e[10][10], k, i, j, n, m, t1, t2, t3;
	//用inf(infinity的缩写)存储一个我们认为的正无穷值
	int inf = 99999999;
	//读入n和m，n表示顶点个数，m表示边的条数
	cin >> n >> m;
	//初始化
	for (i = 1; i <= n; i++)
		for (j = 1; j <= n; j++)
		{
			if (i == j) {
				e[i][j] = 0;
			}
			else {
				e[i][j] = inf;
			}
		}

	//读入边
	for (i = 1; i <= m; i++)
	{
		cin >> t1 >> t2 >> t3;
		e[t1][t2] = t3;
	}

	//Floyd-Warshall算法核心语句
	for (k = 1; k <= n; k++)
		for (i = 1; i <= n; i++)
			for (j = 1; j <= n; j++)
			{
				if (e[i][j] > e[i][k] + e[k][j])
				{
					e[i][j] = e[i][k] + e[k][j];
				}
			}
	//输出最终的结果
	for (i = 1; i <= n; i++)
	{
		for (j = 1; j <= n; j++)
		{
			cout << setw(10) << e[i][j];
		}
		cout << endl;
	}
	return 0;
}