#include <bits/stdc++.h>
using namespace std;

int n, m, d, p;
int TT[500005], RG[500005];
struct E{
    int x, y, d, p;
    bool operator < (E const &aux) const{
        if(d != aux.d) return d < aux.d;
        return p < aux.p;
    }
};
E a[500005];
int c[500005];
inline int find(int x){
    int R;
    for(R = TT[x]; TT[R] != R ; R = TT[R]) ;
    while(x != TT[x]){
        int y = TT[x];
        TT[x] = R;
        x = y;
    }
    return TT[x];
}
inline void unire(int x, int y){
    if(RG[x] > RG[y]) TT[y] = x;
    else if(RG[y] < RG[x]) TT[x] = y;
    else{
        ++RG[y];
        TT[x] = y;
    }
}
int main()
{
    freopen("politie.in", "r", stdin);
    freopen("politie.out", "w", stdout);
    scanf("%d%d%d%d", &n, &m, &d, &p);
    for(int i = 1; i <= m ; ++i)
        scanf("%d%d%d%d", &a[i].x, &a[i].y, &a[i].d, &a[i].p);
    for(int i = 1; i <= n ; ++i) TT[i] = i, RG[i] = 1;
    sort(a + 1, a + m + 1);
    int NR = 0;
    for(int i = 1; i <= m ; ++i){
        if(find(a[i].x) != find(a[i].y)){
            unire(find(a[i].x), find(a[i].y));
            c[++NR] = a[i].p;
        }
    }
    sort(c + 1, c + NR + 1);
    for(int i = NR; i >= 1 && p > 0 ; --i){
        while(c[i] == c[i - 1] && i > 1) --i; --p;
        printf("%d\n", c[i]);
    }
    return 0;
}