#include <iostream>
#include<vector>
#include <algorithm>
#include <cmath>
#include <unordered_map>

using namespace std;

int main() {
	int n, m;
	cin >> n >> m;
	++n;
	vector<int> positions(n);
	for (size_t i = 0; i < n; i++)
	{
		positions[i] = i;
	}
	unordered_map<int, vector<pair<int, int>>> map;
	int x1, x2, y1, y2;
	vector<int> ys;

	for (size_t i = 0; i < m; i++)
	{
		cin >> x1 >> y1 >> x2 >> y2;
		map[y1].push_back({ x1, x2 });
		
	}
	for (auto a : map) {
		ys.push_back(a.first);
	}
	sort(ys.begin(), ys.end());
	vector<pair<int, int>> pairing;
	for (size_t i = 0; i < ys.size(); i++)
	{
		vector<pair<int, int>> vec = map[ys[i]];
		for (auto& p : vec) {
			swap(positions[p.first], positions[p.second]);
		}
	}
	for (size_t i = 1; i < n; i++)
	{
		pairing.push_back({ positions[i], i });
	}
	sort(pairing.begin(), pairing.end());
	for (size_t i = 0; i < pairing.size(); i++)
	{
		cout << pairing[i].second << endl;
	}
}