#include <bits/stdc++.h>
#define oo 1000000001
using namespace std;

/**
viz[i] = 1, daca nodul i se afla in coada
         0, daca nu se afla in coada
cnt[i] = numara de cate ori am pus nodul i in coada.
         daca avem cnt[i] > n, avem ciclu de cost negativ
*/
ifstream fin("distante.in");
ofstream fout("distante.out");

int n, m, d[1502];
bitset<1502> viz;
vector< pair<int, int> > G[1502];
int v[1502], len;

void Citire()
{
    int i, j, c;
    fin >> n >> m;
    for (int p = 1; p <= m; p++)
    {
        fin >> i >> j >> c;
        G[i].push_back({j, c});
    }
}

void DFS(int k)
{
    viz[k] = 1;
    for (auto e : G[k])
        if (!viz[e.first]) DFS(e.first);
    v[++len] = k;
}

void SortTop()
{
    for (int i = 1; i <= n; i++)
        if (!viz[i]) DFS(i);
}
/// O(n + m) pentru digrafuri aciclice
/// Arcele pot avea si costul negative!
void Dijkstra(int s)
{
    int i, k;
    for (i = 1; i <= n; i++)
        d[i] = oo;
    d[s] = 0;
    for (int j = n; j >= 1; j--)
    {
        k = v[j];
        if (d[k] < oo)
        {
            for (auto e : G[k])
            {
                i = e.first;
                if (d[i] > d[k] + e.second)
                    d[i] = d[k] + e.second;
            }
        }
    }
    for (i = 1; i <= n; i++)
        if (d[i] == oo) fout << "x ";
        else fout << d[i] << " ";
    fout << "\n";
}

int main()
{
    Citire();
    SortTop();
    for (int s = 1; s <= n; s++)
        Dijkstra(s);
    return 0;
}