#include <cstdio>
#include <vector>
#include <bitset>
using namespace std;

const int nmx = 50005;

int n, m;
bitset <nmx> viz;
vector <int> g[nmx];

void dfs(const int nod){
    viz[nod] = 1;
    for(vector<int>::iterator it = g[nod].begin(); it != g[nod].end(); ++it)
        if(not viz[*it])
            dfs(*it);
    printf("%d ", nod);
}

int main(){
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    scanf("%d %d", &n, &m);
    for(int i = 1; i <= m; ++i){
        int nod1, nod2;
        scanf("%d %d", &nod1, &nod2);
        g[nod1].push_back(nod2);
        scanf("%d %d", &nod1, &nod2);
    }

    for(int i = 1; i <= n; ++i)
        if(not viz[i])
            dfs(i);

    return 0;
}