#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef pair<ld, ld> pdd;
#define vec vector
#define For(i, a, n) for(ll i=(ll)a;i<n;i++)
#define all(x) begin(x), end(x)
#define sz(x) (ll)size(x)

template<class A, class B>
pair<A,B>operator+(const pair<A, B>&a, const pair<A,B>&b){
    return {a.first + b.first, a.second + b.second};
}
template<class A, class B>
ostream&operator<<(ostream&os, const pair<A, B>&c){
    return os<<"("<<c.first<<", "<<c.second<<")";
}
template<class A, class B, class C>
basic_ostream<A,B>&operator<<(basic_ostream<A, B>&os, const C&c){
    for(auto itr=begin(c);itr!=end(c);++itr){
        os<<(itr==begin(c)?"":" ")<<*itr;
    }
    return os;
}
template<typename...Args>
void dbg(Args&&...args){
    ((cerr<<args<<" |"),...);cerr<<endl;
}


void solve(){
    ll n, m;cin>>n >> m;
    vec<pair<ll, pll>> g(m);
    For(i, 0, m){
        ll a, b, c, d; cin>>a>>b>>c>>d;
        g[i] = {b, {a, c}};
    }
    sort(all(g));
    vec<ll> kto(n);
    For(i, 0, n)kto[i] = i;
    for(auto i: g){
        auto [z, k] = i.second;
        swap(kto[z - 1], kto[k - 1]);
    }

    vec<ll> ans(n);
    For(i, 0, n){
        ans[kto[i]]=i;
    }
    for(auto i : ans)cout<<i+1<<endl;
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int t = 1;
    while(t--)solve();
    return 0;
}