#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

const ll INF = 1e18;

void solve() {
    int n, m;
    cin >> n >> m;
    vector G(3, vector(n, vector<ll>(n, INF)));
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < n; j++) {
            G[i][j][j] = 0;
        }
    }
    for (; m--;) {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        a--, b--;
        for (int i = 0; i <= d; i++) {
            chmin(G[i][a][b], c);
        }
    }

    for (int d = 0; d < 3; d++) {
        for (int k = 0; k < n; k++) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    chmin(G[d][i][j], G[d][i][k] + G[d][k][j]);
                }
            }
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            ll ans = INF;
            for (int k = 0; k < n; k++) {
                chmin(ans, G[2][i][k] + G[1][k][j] + G[0][j][k] + G[1][k][j]);
            }
            cout << (ans == INF ? -1 : ans) << " \n"[j + 1 == n];
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    solve();
    return 0;
}