#include <iostream>
#include <fstream>
#include <queue>

#define NMAX 50005

using namespace std;

ifstream g("sortaret.in");
ofstream gg("sortaret.out");

queue < int > coada;

int N,M;
int viz[ NMAX ];

struct Vector{
    int x,y;
}V[ NMAX ];

void Read(){
    int a,b,i=1;
    g>> N>> M;
    g>> a >>b; coada.push(a);
    while( i <= M ){
        V[ i ].x = a; V[ i ].y = b;
        g>> a>> b;
        i++;
    }
    //gg<<coada.front();
}

void DFS(int nod){
    if(nod <= N){
        for(int i=1; i<=N; i++){
            if(V[i].x == nod && viz[V[i].y] != 1) coada.push(V[i].y),viz[V[i].y] = 1,DFS(V[i].y);
        }
    }
}
void Write(){
    for(int i=1; i<=N; i++){
        gg<< coada.front() << " ";
        coada.pop();
    }
}
int main(void){
    Read();
    viz[coada.front()] = 1;
    DFS(coada.front());
    Write();
    return 0;
}