#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define vvll vector<vll>
#define vpll vector<pair<ll, ll>>
#define pll pair<ll, ll>
#define rep(i, n) for(ll i = 0; i < (ll)n; i++)
#define fi first
#define se second

#define debug false

int main() {
//    freopen("./in.txt", "r", stdin);
//    freopen("./out.txt", "w", stdout);
//    cout << "COMMENT THIS OUT" << endl;

    cin.tie(nullptr);
    cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    ll N, M; cin >> N >> M;

    vector<array<ll, 3>> H(M);
    rep(i, M){
        ll xp, yp, xq, yq;
        cin >> xp >> yp >> xq >> yq;
        H[i][0] = yp;
        H[i][1] = xp;
        H[i][2] = xq;
    }

//    rep(i, M){
//        cout << H[i][0] << " " << H[i][1] << " " << H[i][2] << endl;
//    }
//    cout << endl;

    sort(H.begin(), H.end(), [](const array<ll, 3>& a, const array<ll, 3>& b){
        return a[0] < b[0];
    });

//    rep(i, M){
//        cout << H[i][0] << " " << H[i][1] << " " << H[i][2] << endl;
//    }
//    cout << endl;

    vll perm(N);
    vll ind(N);
    rep(i, N){
        perm[i] = i;
        ind[i] = i;
    }

    rep(i, M){
        ll a = H[i][1];
        ll b = H[i][2];
        a--;
        b--;

        ind[perm[a]] = b;
        ind[perm[b]] = a;

        ll temp = perm[a];
        perm[a] = perm[b];
        perm[b] = temp;
    }

    rep(i, N){
        cout << ind[i] + 1 << endl;
    }

    return 0;
}