/*
  Copyright 2011 Marek "p2004a" Rusinowski
  Floyd-Warshall algorithm
*/
#include <cstdio>
#include <algorithm>

#define MAXN 1000
#define INF 0x0FFFFFFF

int d[MAXN][MAXN];

int main() {
  int n, m, a, b, c;
  scanf("%d %d", &n, &m);
  std::fill((int*)d, (int*)d + MAXN * n, INF);
  for (int i = 0; i < n; ++i) {
    d[i][i] = 0;
  }
  for (int i = 0; i < m; ++i) {
    scanf("%d %d %d", &a, &b, &c);
    d[--a][--b] = c;
    d[b][a] = c;
  }
  for (int k = 0; k < n; ++k) {
    for (int i = 0; i < n; ++i) {
      for (int j = 0; j < n; ++j) {
        d[i][j] = std::min(d[i][j], d[i][k] + d[k][j]);
      }
    }
  }
  for (int j = 0; j < n; ++j) {
    for (int i = 0; i < n; ++i) {
      printf("%3d ", d[j][i]);
    }
    printf("\n");
  }
  return 0;
}