/*************************************
* author: marvinthang *
* created: 02.08.2023 14:55:13 *
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i-- > 0; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
struct Edge {
int u, v, r, p;
Edge(int u = 0, int v = 0, int r = 0, int p = 0): u(u), v(v), r(r), p(p) {}
};
// end of template
const int MAX = 2e5 + 5;
int N, M;
Edge edges[MAX];
vector <int> adj[MAX], r_adj[MAX];
void init(void) {
cin >> N >> M;
REP(i, M) {
int u, v, r, p; cin >> u >> v >> r >> p;
edges[i] = Edge(u, v, r, p);
adj[u].push_back(i);
r_adj[v].push_back(i);
}
}
int deg[MAX], res[MAX];
bool used[MAX];
void process(void) {
queue <int> q;
FORE(i, 1, N) {
deg[i] = adj[i].size();
if (!deg[i]) q.push(i);
}
while (!q.empty()) {
int u = q.front(); q.pop();
res[u] = -1;
for (int id: r_adj[u]) {
int v = edges[id].u;
used[id] = true;
if (!--deg[v]) q.push(v);
}
}
priority_queue <pair <int, int>> pq;
REP(i, M) if (!used[i]) pq.emplace(edges[i].r, i);
while (!pq.empty()) {
auto [ru, i] = pq.top(); pq.pop();
if (used[i]) continue;
used[i] = true;
int u = edges[i].u;
if (!--deg[u]) {
res[u] = ru;
for (int i: r_adj[u]) if (!used[i] && edges[i].r < ru - edges[i].p) pq.emplace(ru - edges[i].p, i);
}
}
FORE(i, 1, N) cout << res[i] << ' ';
}
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
file("A");
init();
process();
cerr << "Time elapsed: " << TIME << " s.\n";
return (0^0);
}
