#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n,m;
    cin >> n >> m;
    vector<vector<pair<long long,long long>>> v;
    v.resize(200005);
    long long maxx = 0;
    for(int i = 0; i < m; i++){
        long long x1,y1,x2,y2;
        cin >> x1 >> y1 >> x2 >> y2;
        x1--;
        x2--;
        v[y1].push_back({x1,x2});
        maxx = max(maxx,y1);
    }
    int maxmn = max(m,n);
    vector<int> hunters ;
    for(int i = 0; i <= 200005; i++){
        if(i<n){hunters.push_back(i);}
        else hunters.push_back(-1);
    }
    for(int i = 0; i < v.size(); i++){
        for(int j = 0; j < v[i].size(); j++){
            long long x = hunters[v[i][j].first];
            hunters[v[i][j].first] = hunters[v[i][j].second];
            hunters[v[i][j].second] = x;
            //if(hunters[v[i][j].second])hunters_pos_id[hunters[v[i][j].second]] = v[i][j].first;
            //hunters_pos_id[x] = hunters[v[i][j].second];

        }
    }
    vector<int> hunters2;
    hunters2.resize(n);

    for(int i = 0 ; i < hunters.size();i++){
        if(hunters[i] != -1)hunters2[hunters[i]] = i;

    }
    for(int i = 0; i < hunters2.size()-1; i++){
        cout << hunters2[i]+1 << endl;
    }
    cout << hunters2[hunters2.size()-1]+1;
}