#include<iostream>
#include<vector>
#include <algorithm>
using namespace std;

struct p {
    int y;
	int a;
	int b;
};

#define FF(x, y, z) for(int x =y; x < z; x++)

int main() {
	int hun;
	int groov;
	cin >> hun >> groov;
	vector<int> hunters;
	vector<p> g;
	g.resize(groov);
	FF(i, 1, hun + 1)
    {
		hunters.push_back(i);
    }

	FF(i, 0, groov) {
		int x, index, x2, ind2;
		cin >> x >> index >> x2 >> ind2;
		g[i].a = x;
		g[i].b = x2;
        g[i].y = index;
	}

    sort(g.begin(), g.end(),[](struct p l, struct p r) {return r.y - l.y;});


	for(int i = groov-1; i>=0 ; i-- ) {
        cout << g[i].a << g[i].b << g[i].y << endl;
		int from = hunters[g[i].a-1];
		hunters[g[i].a-1] = hunters[g[i].b-1];
 		hunters[g[i].b-1] = from;
	}

	//FF(i, 0, hunters.size())
	//    cout << hunters[i] << endl;
    
    FF(i, 0, hunters.size()){
        FF(j,0,hunters.size()){
            if(hunters[j] -1 == i){
                cout << j+1 << endl;
            }
        }
    }

    return 0;
}