#include<bits/stdc++.h>
using namespace std;
int main()
{
int e[10][10], k, i, j, n, m, t1, t2, t3;
int inf = 9999999;
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++)
{
printf("%10d", e[i][j]);
}
cout << endl;
}
return 0;
}