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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int n, m;
        cin >> n >> m;

        constexpr i64 inf = 1e18;
        vector f(3, vector(n, vector<i64>(n, inf)));

        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < n; j++) {
                f[i][j][j] = 0;
            }
        }

        for (int i = 0; i < m; i++) {
            int a, b, c, d;
            cin >> a >> b >> c >> d;
            a--, b--;
            for (int j = 0; j <= d; j++) {
                f[j][a][b] = min<i64>(f[j][a][b], c);
            }
        }

        for (int k = 0; k < n; k++) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    f[0][i][j] = min(f[0][i][j], f[0][i][k] + f[0][k][j]);
                }
            }
        }
        for (int k = 0; k < n; k++) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    f[1][i][j] = min(f[1][i][j], f[1][i][k] + f[0][k][j]);
                }
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                f[2][i][j] = min(f[2][i][j], 2 * f[1][i][j] + f[0][j][i]);
            }
        }
        for (int k = 0; k < n; k++) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    f[2][i][j] = min(f[2][i][j], f[2][i][k] + f[2][k][j]);
                }
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                i64 ans = f[2][i][j];
                if (ans == inf) {
                    ans = -1;
                }
                cout << ans << " \n"[j + 1 == n];
            }
        }
    };
    
    solve();
    
    return 0;
}