#include <iostream>
#include <map>
#include <queue>

struct portal{
    int y;
    int x1;
    int x2;

    friend bool operator < (portal a, portal b ){
        return a.y > b.y; // nebíte mě
    }
};

// z řádku do seznamu portálů
std::priority_queue<portal> portals;

int main() {
    int numHunters;
    std::cin >> numHunters;
    int numGrooves;
    std::cin >> numGrooves;

    for (int i = 0; i< numGrooves; i++) {
        int x1, x2, y1, y2;
        std::cin >> x1;
        std::cin >> y1;
        std::cin >> x2;
        std::cin >> y2;

        portals.push({y1, x1-1, x2-1});
    }

    int boys[numHunters];
    for (int i = 0; i < numHunters; i++){
        boys[i] = i;
    }

    while (!portals.empty()){
        auto p = portals.top();
        portals.pop();

        int temp = boys[p.x1];
        boys[p.x1] = boys[p.x2];
        boys[p.x2] = temp;
    }


    int men[numHunters];

    // najdu kam se dostal týpek a na jeho origo poyici dám, kam se dostal
    for (int i = 0; i < numHunters; i++){
        men[boys[i]] = i+1;
    }

    for (auto m : men){
        std::cout << m<<std::endl;
    }
}