#include <bits/stdc++.h>
using namespace std;
#define ll long long

void testcase() {
    int n,m;
    cin >> n >> m;

    map<ll, vector<pair<ll,ll>>> grooves;
    ll max_y = 0;

    for (ll i = 0; i < m; ++i) {
        ll xp, yp, xq, yq;
        cin >> xp >> yp >> xq >> yq;
        if (grooves.find(yp) != grooves.end()) {
            grooves.insert({yp, {}});
        }
        grooves[yp].push_back({xp, xq});
        if (yp > max_y) {
            max_y = yp;
        }
    }

    vector<ll> hunters(n);
    for (ll i = 0; i < n; ++i) {
        hunters[i] = i+1;
    }

    for (ll y = 0; y < max_y; ++y) {
        if (grooves.find(y+1) != grooves.end()) {
            auto& groove_row = grooves[y+1];
            for (auto& groove : groove_row) {
                for (ll hi = 0; hi < n; ++hi) {
                    if (hunters[hi] == groove.first) {
                        hunters[hi] = groove.second;
                    } else if (hunters[hi] == groove.second) {
                        hunters[hi] = groove.first;
                    }
                }
            }
        }
    }

    for (ll i = 0; i < n; ++i) {
        cout << hunters[i] << "\n";
    }
    
}



int main() {
    testcase();
}