#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
class cmp
{
public:
    bool operator()(pair <int,int>a,pair <int,int>b)
    {
        return a.second<b.second;
    }
};
priority_queue <pair <int,int>,vector<pair<int,int> >,cmp> coada;
priority_queue <pair <int,int>,vector<pair<int,int> >,cmp> coada2;
vector <pair<int,int> > graf[250002];
vector <pair<int,int> > grafp[250002];
int gr[250002],sol[250002],fr[250002],viz[250002],per[250002];
int n,m,i,j,nod,grad,x,y,d,p,a,b,c,nr,tip,yy,dd;
void bf()
{
    while(!coada.empty())
    {
        nod=coada.top().first;
        tip=coada.top().second;
        grad=coada2.top().second;
        coada2.pop();
        coada.pop();
        for(j=0;j<graf[nod].size();j++)
        {
            x=graf[nod][j].first;
            y=graf[nod][j].second;
            yy=grafp[nod][j].second;
            if(x>i)
            {
                if(!viz[x])
                {
                    coada.push(make_pair(x,max(tip,y)));
                    coada2.push(make_pair(x,max(grad,yy)));
                    gr[x]=max(grad,yy);
                    per[x]=max(tip,y);
                    viz[x]=1;
                }
                else
                {
                    if(max(tip,y)==1&&per[x]!=1)
                    {
                        coada.push(make_pair(x,max(tip,y)));
                        coada2.push(make_pair(x,max(grad,yy)));
                        gr[x]=max(grad,yy);
                        per[x]=max(tip,y);
                    }
                    else
                    {
                        if(max(tip,y)<per[x])
                        {
                            coada.push(make_pair(x,max(tip,y)));
                            coada2.push(make_pair(x,max(grad,yy)));
                            gr[x]=max(grad,yy);
                            per[x]=max(tip,y);
                        }
                        else
                        {
                            if(max(tip,y)==per[x]&&max(grad,yy)<gr[x])
                            {
                                coada.push(make_pair(x,max(tip,y)));
                                coada2.push(make_pair(x,max(grad,yy)));
                              gr[x]=max(grad,yy);
                            }
                        }
                    }
                }
            }
        }
    }
}
int main()
{
    ifstream in("politie.in");
    ofstream out("politie.out");
    in>>n>>m>>d>>p;
    for(i=1;i<=m;i++)
    {
        in>>a>>b>>c>>dd;
        graf[a].push_back(make_pair(b,c));
        graf[b].push_back(make_pair(a,c));
        grafp[a].push_back(make_pair(b,dd));
        grafp[b].push_back(make_pair(a,dd));
    }
    nr=0;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
        {
            viz[j]=0;
        }
        coada.push(make_pair(i,0));
        coada2.push(make_pair(i,0));
        viz[i]=1;
        bf();
        for(j=1;j<=n;j++)
        {
            if(!fr[gr[j]]&&gr[j]>0)
            {
                sol[++nr]=gr[j];
                fr[gr[j]]=1;
            }
            gr[j]=0;
            per[j]=0;
        }
    }
    sort(sol+1,sol+nr+1);
    for(i=nr;i>=1;i--)
    {
        if(p)
        {
            out<<sol[i]<<"\n";
            p--;
        }
        else
        {
            break;
        }
    }
    return 0;
}