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

int main() {
	int n, m; scanf("%d %d", &n, &m);
	vector<pair<int, pair<int, int>>> swaps(m);
	for (int i=0; i<m; i++) {
		int x1, y1, x2, y2; scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
		x1--; x2--;
		swaps[i] = {y1, {min(x1, x2), max(x1, x2)}};
	}
	sort(swaps.begin(), swaps.end());
	vector<int> idxs(n);
	for (int i=0; i<n; i++)
		idxs[i] = i;
	for (int i=0; i<m; i++) {
		auto [_, s] = swaps[i];
		swap(idxs[s.first], idxs[s.second]);
	}
	vector<int> pos(n);
	for (int i=0; i<n; i++) {
		// printf("%d ", idxs[i]);
		pos[idxs[i]] = i;
	}
	// printf("\n");
	for (int p : pos) {
		printf("%d\n", p+1);
	}
}