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

#define mp pair<int, pair<int, int>>

void solve()
{
    int h, l;
    cin >> h >> l;
    vector<int> na(h);
    for(int i = 0; i < h; i++)
        na[i] = i + 1;
    vector<mp> v(l);
    for(int i = 0; i < l; i++)
    {
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        v[i] = {y1, {x1 - 1, x2 - 1}};
    }
    sort(v.begin(), v.end());
    for(auto p : v)
    {
        int x1 = p.second.first;
        int x2 = p.second.second;
        swap(na[x1], na[x2]);
    }


    vector<pair<int, int>> asdf(h);
    for(int i = 0; i < h; i++)
        asdf[i] = {na[i], i + 1};
    sort(asdf.begin(), asdf.end());

    for(auto i : asdf)
        cout << i.second << endl;
}

int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    solve();

    return 0;
}