#include <bits/stdc++.h>

#define int long long
#define vec vector
#define forn(i, n) for(int i = 0;i<n;i++)
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define read(a) forn(i, (a).size()) cin>>(a)[i]
#define write(a) forn(i, (a).size()) cout<<(a)[i] << " "; cout << "\n";

using namespace std;

int mod = 1e9+7;

struct st{
    int x1, y1, x2, y2;
};

bool comp(st a, st b){
    return a.y1 < b.y1;
}

void solve(){
    int n, m;
    cin>>n>>m;
    vec<int> a(n);
//    read(a);
    vec<st> b(m);
    for(int i = 0;i<m;i++)
    {
        cin>>b[i].x1>>b[i].y1>>b[i].x2>>b[i].y2;
    }

    sort(all(b), comp);

    vec<int> final(n);
    for(int i = 0;i<n;i++)
        final[i] = i;

    for(int i = 0;i<b.size();i++){
        int from = b[i].x1-1;
        int to = b[i].x2-1;
        swap(final[from], final[to]);
    }

    vec<int> ans(n);
    for(int i = 0;i<n;i++)
    {
        ans[final[i]] = i;
    }

    for(int i = 0;i<ans.size();i++)
        cout << ans[i] + 1 << "\n";
}

signed main()
{
    int tt = 1;
    while(tt--){
        solve();
    }
}