#include<stdlib.h>
#include<stdio.h>

typedef struct 
{
    int start, end;
} pair;
pair * create_pair(int a, int b);



int main(int argc, char const *argv[])
{
    int h, g;

    scanf("%d %d", &h, &g);
    fprintf(stderr,"%d %d\n", h, g);
    int * hs = malloc(sizeof(int)*h);
    for(int i = 0; i< h; i++){
        hs[i]=i;
    }
    pair *** grooves = malloc(sizeof(pair **)*g);
    int * idxs = calloc(sizeof(int), g);
    int idx = 0;
    for(int i = 0; i< g; i++){
        grooves[i] = malloc(sizeof(pair*)*(h/2));
    }
    for(int i = 0; i<g; i++){
        int xp, xq, yp, yq;
        scanf("%d %d %d %d", &xp, &yp, &xq, &yq);
        yp--;
        grooves[yp][idxs[yp]++] = create_pair(xp-1, xq-1);
        idx = yp>idx?yp:idx;
    }
    for(int i  =0; i<=idx; i++){
        for(int j  = 0 ; j< idxs[i]; j++){
            pair * p = grooves[i][j];
            int tmp = hs[p->start];
            hs[p->start] = hs[p->end];
            hs[p->end] = tmp; 
        }
    }
    int*res = malloc(sizeof(int)*h);
    for(int i =0; i<h; i++){\
        res[hs[i]] = i+1; 
    }
    for(int i = 0; i< h; i++){
        printf("%d\n",res[i]);
    }

    free(hs);
    for(int i =0; i< g; i++){
        for(int j =0; j< idxs[i]; j++){
            free(grooves[i][j]);
        }
        free(grooves[i]);
    }
    free(grooves);
    free(idxs);

    return 0;
}

pair * create_pair(int a, int b)
{
    pair * p = malloc(sizeof(pair));
    p->start = a;
    p-> end = b;
    return p;
}