///#include "dungeon2.h"
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define int   long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "ftree"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l,int r)
{
    return uniform_int_distribution<int>(l,r)(rd);
}
void phongbeo();
const int inf = 1e9;
const ll mod2 = 998244353;
const ll base=67;
int  n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,lim,w,l,r,dem5,dem6,dem7,dem9;
int kk;
int t;
int el = 19;
main()
{
    if(fopen(task2".inp","r"))
    {
        fin(task2);
        fou(task2);
    }
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    /// cin>>s1;
//int t;cin>>t; while(t--)
    phongbeo();
    //  checktime
}
struct ib
{
    int a,b;
};
struct id
{
    int a,b,c,d;
};
bool cmp(id a,id b)
{
    return a.c>b.c;
}
int cost[100001];
int color[300001];
vector<id> v;
struct dsucd
{
    ib dsu[1001];
    void reset(int n)
    {
        for(int i=1; i<=n; i++)
            dsu[i]= {1,i};
    }
    int get(int x)
    {
        if(dsu[x].b!=x) dsu[x].b=get(dsu[x].b);
        return dsu[x].b;
    }
    void noi(int x,int y)
    {
        x=get(x);
        y=get(y);
        if(dsu[x].a<dsu[y].a)swap(x,y);
        dsu[x].a+=dsu[y].a;
        dsu[y].b=x;
    }
} ds[10001];
void phongbeo()
{
    cin>>n>>m>>k;
    for(int i=0; i<k; i++)
        ds[i].reset(n);
    for(int i=1; i<=m; i++)
    {
        cin>>l>>r>>s2;
        v.pb({l,r,s2,i});
    }
    sort(v.begin(),v.end(),cmp);
    for(auto x:v)
    {
        l=0;
        r=k-1;
        while(l<=r)
        {
            int mid=l+r>>1;
            int xx=ds[mid].get(x.a);
            int yy=ds[mid].get(x.b);
            if(xx==yy)l=mid+1;
            else r=mid-1;
        }
        if(l==k) continue;
        color[x.d]=l+1;
        ds[l].noi(x.a,x.b);
        cost[l]+=x.c;
    }
    for(int i=1; i<=m; i++)
        cout<<color[i],down
}