#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
const int N=10010;
typedef long long ll;
namespace dinic{
    const int inf=0x3f3f3f3f;
    int nxt[N<<1],from[N<<1],to[N<<1],w[N<<1],head[N],cur[N],cnt=1,n;
    int add(int u,int v,int w0)
    {
        nxt[++cnt]=head[u],from[cnt]=u,to[cnt]=v,w[cnt]=w0;head[u]=cnt;
        nxt[++cnt]=head[v],from[cnt]=v,to[cnt]=u,w[cnt]=0;head[v]=cnt;
        return cnt;
    }
    int dep[N];queue<int>q;
    bool bfs(int s,int t)
    {
        while(!q.empty()) q.pop();
        for(int i=1;i<=n;i++) dep[i]=-1,cur[i]=head[i];
        dep[s]=0,q.push(s);
        while(!q.empty())
        {
            int u=q.front();q.pop();
            for(int i=head[u];i;i=nxt[i]) if(w[i])
            {
                int v=to[i];
                if(dep[v]==-1) dep[v]=dep[u]+1,q.push(v);
            }
        }
        return dep[t]!=-1;
    }
    int dfs(int u,int t,int flow=inf)
    {
        if(u==t || !flow) return flow;
        int res=0;
        for(int &i=cur[u];i;i=nxt[i]) if(w[i])
        {
            int v=to[i],f;
            if(dep[v]==dep[u]+1 && (f=dfs(v,t,min(flow,w[i]))))
            {
                w[i]-=f,w[i^1]+=f;
                flow-=f,res+=f;
                if(!flow) break;
            }
        }
        return res;
    }
    ll solve(int s,int t){ll r=0;while(bfs(s,t)) r+=dfs(s,t);return r;}
}
int x[N],y[N],w[N],id[N],s0,t0;ll deg[N];
int main()
{
    int n,m,k;scanf("%d%d%d",&n,&m,&k);
    s0=n+1,t0=s0+1;dinic::n=t0;
    ll res=0;
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x[i],&y[i],&w[i]);
        deg[x[i]]-=w[i],deg[y[i]]+=w[i];
        id[i]=dinic::add(y[i],x[i],1);
    }
    for(int i=1;i<=n;i++) if(deg[i]>0) dinic::add(s0,i,deg[i]/k),res+=deg[i]/k;
    else if(deg[i]<0) dinic::add(i,t0,-deg[i]/k);
    ll ans=dinic::solve(s0,t0);
    if(res!=ans){puts("IMPOSSIBLE");return 0;}
    else
    {
        for(int i=1;i<=m;i++) if(dinic::w[id[i]]==1) printf("%d\n",w[i]-k);
        else printf("%d\n",w[i]);
    }
    return 0;
}
/*
5 6 5
1 2 2
1 3 3
3 2 3
2 4 2
5 4 3
5 2 2
*/