#include <fstream>
#include <algorithm>
#include <vector>
#define LL long long

using namespace std;

ifstream fin("lazy.in");
ofstream fout("lazy.out");

const int VAL=200005;

struct muchie
{
    int A, B, ind;
    LL C1, C2;
};

muchie MCH[VAL];

int N, M, i, j;
int X, Y, FAT[VAL];
vector <int> SOL;

bool cmp(muchie X, muchie Y)
{
    if (X.C1!=Y.C1)
        return X.C1<Y.C1;
    return X.C2>Y.C2;
}

int Get_FAT(int nod)
{
    if (FAT[nod]!=nod)
        FAT[nod]=Get_FAT(FAT[nod]);
    return FAT[nod];
}

int main()
{
    fin >> N >> M;
    for (i=1; i<=M; i++)
    {
        fin >> MCH[i].A >> MCH[i].B >> MCH[i].C1 >> MCH[i].C2;
        MCH[i].ind=i;
    }
    for (i=1; i<=N; i++)
        FAT[i]=i;
    sort(MCH+1, MCH+M+1, cmp);
    for (i=1; i<=M; i++)
    {
        X=Get_FAT(MCH[i].A);
        Y=Get_FAT(MCH[i].B);
        if (X!=Y)
        {
            SOL.push_back(MCH[i].ind);
            FAT[X]=Y;
        }
    }
    for (i=0; i<N-1; i++)
        fout << SOL[i] << '\n';
    fin.close();
    fout.close();
    return 0;
}