#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;++i)
#define per(i,n) for(int i=n;i>=1;--i)
#define pb push_back
#define mp make_pair
#define N 1011
#define M 110000
#define inf 100000000
int S, T;
struct EDGE { int adj, w, next; } edge[M];
int n, top, gh[N], nrl[N], net[N];
void addedge(int x, int y, int w) {
    edge[++top].adj = y;
    edge[top].w = w;
    edge[top].next = gh[x];
    gh[x] = top;
    edge[++top].adj = x;
    edge[top].w = 0;
    edge[top].next = gh[y];
    gh[y] = top;
}
int dist[N], q[N];
int bfs() {
    memset(dist, 0, sizeof(dist)); 
    q[1] = S; int head = 0, tail = 1; dist[S] = 1;
    while (head != tail) {
        int x = q[++head];
        for (int p=gh[x]; p; p=edge[p].next)
            if (edge[p].w && !dist[edge[p].adj]) {
                dist[edge[p].adj] = dist[x] + 1;
                q[++tail] = edge[p].adj;
            }
    }
    return dist[T];
}
int dinic(int x, int delta) {
    if (x==T) return delta;
    for (int& p=nrl[x]; p && delta; p=edge[p].next)
        if (edge[p].w && dist[x]+1 == dist[edge[p].adj]) {
            int dd = dinic(edge[p].adj, min(delta, edge[p].w));
            if (!dd) continue;
            edge[p].w -= dd;
            edge[p^1].w += dd;
            return dd;
        }
    return 0;
}
int work() {
    int ans = 0;
    while (bfs()) {
        memcpy(nrl, gh, sizeof(gh));
        int t; while (t = dinic(S, inf)) ans += t;
    }
    return ans;
}

int id[M];
int a[M],b[M],c[M];
int main() {
	int n, m, r;
	top=1;
	scanf("%d%d%d", &n, &m, &r);
	S = 0;
	T = n + 1;
	for(int i = 1; i <= m; i++) {
		scanf("%d%d%d", &a[i], &b[i], &c[i]);
		net[a[i]] -= c[i];
		net[b[i]] += c[i];
		id[i]=top+1;
		addedge(b[i], a[i], 1);
	}
	for(int i = 1; i <= n; i++) {
		if(net[i] > 0) {
			addedge(S, i, net[i] / r);
		}
		if(net[i] < 0) {
			addedge(i, T, -net[i] / r);
		}
	}
	work();
	for(int i = 1; i <= m; i++) {
		//cout << c[i] << ' ' << '?' << endl;
		printf("%d\n", c[i] - ((edge[id[i]].w==0)? r : 0));
	}
}