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

#define akemi_homura std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define endl '\n'
#define int long long
#define PII pair<int,int>

const double pi = acos(-1);
const int mod = 1e9 + 7;
const int MOD = 998244353;
const int M = 1e6 + 5;
const int N = 3e3 + 5;

int n, m;
struct node
{
    int edge;
    int weight;
};
vector<node>g[N];
bool flag;

int dist[N];
bool vis[N];
int cnt[N];
int dd[N];

void spfa(int s) 
{
    queue<int>q;
    for (int i = 1; i <= n; i++)dist[i] = (int)1e18;
    memset(vis, 0, sizeof vis);
    memset(cnt, 0, sizeof cnt);
    dist[s] = 0, vis[s] = 1;
    q.push(s);
    while (!q.empty()) 
    {
        int u = q.front();
        q.pop(), vis[u] = 0;
        for (auto ed : g[u])
        {
            int v = ed.edge, w = ed.weight;
            if (dist[v] > dist[u] + w) {
                dist[v] = dist[u] + w;
                cnt[v] = cnt[u] + 1; 
                if (cnt[v] >= n)
                {
                    flag = 1;
                    return;
                }
                if (!vis[v]) q.push(v), vis[v] = 1;
            }
        }
    }
}

void diji(int s)
{
    memset(vis, 0, sizeof vis);
    for (int i = 1; i <= n; i++)dd[i] = (int)1e18;
    priority_queue<PII, vector<PII>, greater<PII>>q;
    dd[s] = 0;
    q.push({0,s});
    while (q.size())
    {
        int u = q.top().second;
        q.pop();
        if (vis[u])continue;
        vis[u] = 1;
        for (int i = 0; i < g[u].size(); i++)
        {
            int v = g[u][i].edge;
            int w = g[u][i].weight;
            if (dd[v] > dd[u] + w)
            {
                dd[v] = dd[u] + w;
                q.push({ dd[v],v });
            }
        }
    }

}

void _solve()
{
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        g[a].push_back({ b,c });
    }
    for (int i = 1; i <= n; i++)
    {
        g[0].push_back({ i,0 });
    }
    spfa(0);
    if (flag)
    {
        cout << -1 << endl;
        return;
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 0; j < g[i].size(); j++)
        {
            g[i][j].weight = g[i][j].weight + dist[i] - dist[g[i][j].edge];
        }
    }
    vector<int>ans;
    for (int i = 1; i <= n; i++)
    {
        int tem = 0;
        diji(i);
        for (int j = 1; j <= n; j++)
        {
            if (dd[j] == (int)1e18)tem = (tem + j * (int)1e9);
            else if (i == j)continue;
            else tem = (tem + j * (dd[j] + dist[j]-dist[i]));
        }
        ans.push_back(tem);
    }
    for (auto i : ans)
    {
        cout << i << endl;
    }



}

signed main()
{
    akemi_homura;
    int Case = 1;
    //cin >> Case;
    while (Case--)
    {
        _solve();
    }
    return 0;
}