#include <bits/stdc++.h>
#define MAX_M 20
#define MAX_N 100
using namespace std;
int n, m;
int sequence[MAX_M];
pair<int, int> evi[MAX_N];

//?????????
void init() {
    for(int r = 0; r < MAX_M; r++) {
        sequence[r] = r+1;
    }
}

//??°????????§?°???¢????????????
int compareTo(const int x, const int y) {
    if(x == 2) return(0);
    if(y == 2) return(1);
    for(int r = 0; r < n; r++) {
        if(evi[r].first == x && evi[r].second == y) { //x??????????°???????
            return(1);
        } else if(evi[r].first == y && evi[r].second == x) { //y??????????°???????
            return(0);
        }
    }
    return(-1); //?????????
}

void solve() {
    init();
    sort(sequence, sequence+m, compareTo);
    for(int r = 0; r < m; r++) {
        printf("%d\n", sequence[r]);
    }
}

int main(void) {
    cin >> m; cin >> n;
    for(int r = 0; r < n; r++) {
        int before, after; cin >> before >> after;
        evi[r] = make_pair(before, after);
    }
    solve();
    return(0);
}