#include<bits/stdc++.h>
using namespace std;
#define int long long
int read(){
	int f = 1,x = 0;
	char c = getchar();
	while(c > '9' || c < '0'){
		if(c == '-') f = -1;
		c = getchar();
	}
	while(c >= '0' && c <= '9'){
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x * f;
}
const int maxn = 21005;
int s,t;
int n,r,m;
struct stu{
	int to,nxt,w;
}se[maxn];
int hd[maxn],cnt = 1;
void jia(int x,int y,int z){
	se[++cnt].to = y;
	se[cnt].nxt = hd[x];
	se[cnt].w = z;
	hd[x] = cnt;
}
int du[maxn];
const int inf = 1e8;
int lv[maxn],cur[maxn];
bool bfs()
{
	memset(lv,-1,sizeof(lv));
	lv[s] = 0;
	for(int i=1;i<=n + 2;++i) cur[i] = hd[i];
	queue<int> q;
	q.push(s);
	while(!q.empty()){
		int u = q.front();
		q.pop();
		for(int i=hd[u];i;i=se[i].nxt){
			int v = se[i].to ;
			int vv = se[i].w;
			if(vv > 0 && lv[v] == -1){
				lv[v] = lv[u] + 1;
				q.push(v);
			}
		}
	}
	return lv[t] != -1; 
}
int dfs(int p = s,int fl = inf)
{
	if(p == t) return fl;
	int rmn = fl;
	for(int i=cur[p];i && rmn;i = se[i].nxt){
		cur[p] = i;
		int v = se[i].to ;
		int vl = se[i].w;
		if(vl > 0 && lv[v] == lv[p] + 1){
			int c = dfs(v,min(vl,rmn));
			rmn -= c;
			se[i].w -= c;
			se[i^1].w += c;
		}
	}
	return fl - rmn;
}
int noi[maxn];
signed main()
{
	n = read(),r = read(),m = read();
	for(int i=1;i<=r;++i){
		int x = read(),y = read(),z = read();
		jia(x,y,0);
		jia(y,x,1);
		noi[i] = z;
		du[y] += z;
		du[x] -= z;
	}
	s = n + 1;
	t = n + 2;
	int qwq = 0;
	for(int i=1;i<=n;++i){
		du[i] /= m;
		if(du[i] < 0){
			jia(i,t,-du[i]);
			jia(t,i,0);
		}
		if(du[i] > 0){
			qwq += du[i];
			jia(s,i,du[i]);
			jia(i,s,0);
		}
	}
	int ans = 0;
	while(bfs()){
		ans += dfs();
	}
	if(ans < qwq){
		printf("IMPOSSIBLE");
		return 0;
	}
	for(int i=1;i<=r;++i){
		if(se[i*2].w == 1) printf("%lld\n",noi[i] - m);
		else printf("%lld\n",noi[i]);
	}
}