#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream f ("lazy.in");
ofstream g ("lazy.out");

const int NMAX = 200000 + 1;

struct Muchie {
    int a, b, poz;
    long long c1, c2;
    bool ales;
    Muchie(int a, int b, long long c1, long long c2, int poz) {
        this->a = a;
        this->b = b;
        this->c1 = c1;
        this->c2 = c2;
        this->poz = poz;
        this->ales = false;
    };
};

int n, m;
vector <Muchie> muchii;
int t[NMAX], h[NMAX];

void citeste() {
    int a, b;
    long long c1, c2;
    f >> n >> m;
    for (int i = 1; i <= m; i++) {
        f >> a >> b >> c1 >> c2;
        muchii.push_back(Muchie(a, b, c1, c2, i));

        t[i] = i;
        h[i] = 1;
    }
}

int radacina(int a) {
    while (t[a] != a) a = t[a];
    return a;
}

void uneste(int a, int b) {
    if (h[a] > h[b]) t[b] = a;
    else t[a] = b;
    if (h[a] == h[b]) h[b]++;
}

void rezolva() {
    int a, b;
    long long sol;
    for (int i = 0; i < m; i++) {
        a = radacina(muchii[i].a);
        b = radacina(muchii[i].b);
       // cout << a << ' ' << b << endl;
        if (a != b) {
            uneste(a, b);
            muchii[i].ales = true;
            g << muchii[i].poz << '\n';
        }
    }
}

bool conditie(Muchie a, Muchie b) {
    if (a.c1 == b.c1) return a.c2 > b.c2;
    return a.c1 < b.c1;
}


int main() {
    citeste();
    sort(muchii.begin(), muchii.end(), conditie);
    rezolva();
    return 0;
}