#include "bits/stdc++.h"

using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, m, mod;
    cin >> n >> m >> mod;
    vector<int> a(m), b(m), c(m), tmp(n);
    vector<vector<int>> g(n);
    for (int i = 0; i < m; i++) {
        cin >> a[i] >> b[i] >> c[i];
        a[i]--, b[i]--;
        tmp[a[i]] += c[i];
        tmp[b[i]] -= c[i];
        g[a[i]].push_back(i);
        g[b[i]].push_back(i);
    }
    for (int v = 0; v < n; v++) {
        while (tmp[v] > 0) {
            bool find = false;
            vector<int> stk, res;
            set<array<int, 3>> usd;
            function<void(int, int, int)> dfs = [&] (int v, int pr, int d) {
                if (!usd.insert({v, pr, d}).second) {
                    return;
                }
                if (find) {
                    return;
                }
                if (tmp[v] < 0 && d == 1) {
                    find = true;
                    res = stk;
                    return;
                }
                for (auto i : g[v]) {
                    if (i == pr) {
                        continue;
                    }
                    int u = a[i] ^ b[i] ^ v;
                    if (v == a[i]) {
                        if (d == 0 && c[i] > 0) {
                            stk.push_back(i);
                            dfs(u, i, d ^ 1);
                            stk.pop_back();
                        } else if (d == 1 && c[i] < 0) {
                            stk.push_back(i);
                            dfs(u, i, d ^ 1);
                            stk.pop_back();
                        }
                    } else {
                        if (d == 0 && c[i] < 0) {
                            stk.push_back(i);
                            dfs(u, i, d ^ 1);
                            stk.pop_back();
                        } else if (d == 1 && c[i] > 0) {
                            stk.push_back(i);
                            dfs(u, i, d ^ 1);
                            stk.pop_back();
                        }
                    }
                }
            };
            dfs(v, -1, 0);
            for (auto i : res) {
                tmp[a[i]] -= c[i];
                tmp[b[i]] += c[i];
                if (c[i] > 0) {
                    c[i] = c[i] - mod;
                } else {
                    c[i] = c[i] + mod;
                }
                tmp[a[i]] += c[i];
                tmp[b[i]] -= c[i];
            }
        }
    }
    for (int i = 0; i < m; i++) {
        assert(c[i] != 0 && -mod < c[i] && c[i] < mod);
        cout << c[i] << '\n';
    }
}